./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:36:05,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:36:05,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:36:05,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:36:05,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:36:05,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:36:05,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:36:05,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:36:05,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:36:05,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:36:05,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:36:05,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:36:05,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:36:05,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:36:05,430 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:36:05,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:36:05,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:05,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:36:05,431 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:36:05,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2025-03-16 21:36:05,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:36:05,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:36:05,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:36:05,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:36:05,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:36:05,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-16 21:36:06,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bd4efd9/884246559636439bafb460b5b669ca0e/FLAG0523dc443 [2025-03-16 21:36:07,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:36:07,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-16 21:36:07,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bd4efd9/884246559636439bafb460b5b669ca0e/FLAG0523dc443 [2025-03-16 21:36:07,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bd4efd9/884246559636439bafb460b5b669ca0e [2025-03-16 21:36:07,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:36:07,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:36:07,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:07,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:36:07,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:36:07,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07, skipping insertion in model container [2025-03-16 21:36:07,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:36:07,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2025-03-16 21:36:07,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:07,337 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:36:07,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2025-03-16 21:36:07,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:07,397 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:36:07,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07 WrapperNode [2025-03-16 21:36:07,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:07,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:07,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:36:07,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:36:07,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,455 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 187 [2025-03-16 21:36:07,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:07,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:36:07,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:36:07,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:36:07,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:36:07,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,502 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:36:07,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:36:07,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:36:07,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:36:07,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (1/1) ... [2025-03-16 21:36:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:07,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:07,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:36:07,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:36:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:36:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:36:07,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:36:07,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:36:07,632 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:36:07,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:36:07,918 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-16 21:36:07,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:36:07,943 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:36:07,943 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:36:07,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:07 BoogieIcfgContainer [2025-03-16 21:36:07,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:36:07,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:36:07,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:36:07,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:36:07,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:36:07" (1/3) ... [2025-03-16 21:36:07,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e989005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:07, skipping insertion in model container [2025-03-16 21:36:07,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:07" (2/3) ... [2025-03-16 21:36:07,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e989005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:07, skipping insertion in model container [2025-03-16 21:36:07,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:07" (3/3) ... [2025-03-16 21:36:07,952 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2025-03-16 21:36:07,963 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:36:07,965 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example_v.c that has 1 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:36:08,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:36:08,018 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15b7ee77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:36:08,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:36:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 21:36:08,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:08,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:08,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:08,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash 711580305, now seen corresponding path program 1 times [2025-03-16 21:36:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:08,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-03-16 21:36:08,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:08,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:08,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 21:36:08,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 21:36:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-03-16 21:36:08,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248507507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:08,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:08,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396948329] [2025-03-16 21:36:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:08,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:08,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:08,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:08,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:08,399 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:08,456 INFO L93 Difference]: Finished difference Result 87 states and 127 transitions. [2025-03-16 21:36:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 21:36:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:08,462 INFO L225 Difference]: With dead ends: 87 [2025-03-16 21:36:08,463 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 21:36:08,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:08,469 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:08,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 21:36:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-16 21:36:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2025-03-16 21:36:08,498 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 12 [2025-03-16 21:36:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:08,498 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2025-03-16 21:36:08,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2025-03-16 21:36:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 21:36:08,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:08,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:08,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:36:08,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 588832160, now seen corresponding path program 1 times [2025-03-16 21:36:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845631058] [2025-03-16 21:36:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:08,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 21:36:08,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 21:36:08,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:08,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845631058] [2025-03-16 21:36:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845631058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251504692] [2025-03-16 21:36:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:08,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:08,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:08,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:08,610 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:08,651 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2025-03-16 21:36:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:08,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 21:36:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:08,652 INFO L225 Difference]: With dead ends: 89 [2025-03-16 21:36:08,652 INFO L226 Difference]: Without dead ends: 50 [2025-03-16 21:36:08,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:08,653 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:08,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-16 21:36:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-16 21:36:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-03-16 21:36:08,656 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 13 [2025-03-16 21:36:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:08,657 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-03-16 21:36:08,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2025-03-16 21:36:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 21:36:08,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:08,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:08,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:36:08,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1289530260, now seen corresponding path program 1 times [2025-03-16 21:36:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:08,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577863901] [2025-03-16 21:36:08,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:08,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 21:36:08,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 21:36:08,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:08,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:08,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:08,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577863901] [2025-03-16 21:36:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577863901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:36:08,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116182193] [2025-03-16 21:36:08,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:08,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:36:08,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:08,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:36:08,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:08,887 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:08,985 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2025-03-16 21:36:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:36:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 21:36:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:08,987 INFO L225 Difference]: With dead ends: 118 [2025-03-16 21:36:08,987 INFO L226 Difference]: Without dead ends: 77 [2025-03-16 21:36:08,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:08,988 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 44 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:08,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 180 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-16 21:36:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2025-03-16 21:36:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2025-03-16 21:36:08,995 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 14 [2025-03-16 21:36:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2025-03-16 21:36:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2025-03-16 21:36:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 21:36:08,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:08,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:08,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:36:08,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1081582162, now seen corresponding path program 1 times [2025-03-16 21:36:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263173831] [2025-03-16 21:36:08,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:08,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:09,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 21:36:09,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 21:36:09,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:09,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263173831] [2025-03-16 21:36:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263173831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:09,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76139606] [2025-03-16 21:36:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:09,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:09,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:09,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:09,457 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:09,576 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2025-03-16 21:36:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:09,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 21:36:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:09,577 INFO L225 Difference]: With dead ends: 143 [2025-03-16 21:36:09,577 INFO L226 Difference]: Without dead ends: 102 [2025-03-16 21:36:09,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:36:09,578 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:09,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 377 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-16 21:36:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 63. [2025-03-16 21:36:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2025-03-16 21:36:09,583 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 33 [2025-03-16 21:36:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:09,583 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2025-03-16 21:36:09,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2025-03-16 21:36:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 21:36:09,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:09,584 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:09,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:36:09,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -339164102, now seen corresponding path program 1 times [2025-03-16 21:36:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-03-16 21:36:09,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:09,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 21:36:09,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 21:36:09,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:09,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-03-16 21:36:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804287952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:09,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029081515] [2025-03-16 21:36:09,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:09,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:09,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:09,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:36:10,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 21:36:10,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 21:36:10,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:10,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:10,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 21:36:10,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:10,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:36:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029081515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:36:10,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-03-16 21:36:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070112480] [2025-03-16 21:36:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:10,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:10,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:10,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:36:10,350 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:10,583 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2025-03-16 21:36:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:36:10,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 21:36:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:10,585 INFO L225 Difference]: With dead ends: 156 [2025-03-16 21:36:10,585 INFO L226 Difference]: Without dead ends: 102 [2025-03-16 21:36:10,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:36:10,586 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 136 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:10,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 84 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-16 21:36:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2025-03-16 21:36:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2025-03-16 21:36:10,596 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 34 [2025-03-16 21:36:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:10,596 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2025-03-16 21:36:10,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2025-03-16 21:36:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 21:36:10,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:10,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:10,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:36:10,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:10,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1782149566, now seen corresponding path program 1 times [2025-03-16 21:36:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:10,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034617830] [2025-03-16 21:36:10,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 21:36:10,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 21:36:10,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:10,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034617830] [2025-03-16 21:36:11,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034617830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:11,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:11,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:11,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062238112] [2025-03-16 21:36:11,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:11,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:11,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:11,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:11,131 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:11,314 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2025-03-16 21:36:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 21:36:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:11,316 INFO L225 Difference]: With dead ends: 178 [2025-03-16 21:36:11,316 INFO L226 Difference]: Without dead ends: 124 [2025-03-16 21:36:11,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:36:11,316 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 170 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:11,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 199 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-16 21:36:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2025-03-16 21:36:11,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3548387096774193) internal successors, (126), 93 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2025-03-16 21:36:11,326 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 35 [2025-03-16 21:36:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:11,326 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2025-03-16 21:36:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2025-03-16 21:36:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 21:36:11,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:11,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:11,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:36:11,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1227271627, now seen corresponding path program 1 times [2025-03-16 21:36:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302611104] [2025-03-16 21:36:11,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:11,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 21:36:11,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 21:36:11,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:11,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302611104] [2025-03-16 21:36:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302611104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002912086] [2025-03-16 21:36:11,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:11,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:11,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 21:36:11,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 21:36:11,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 21:36:11,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:11,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:11,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-03-16 21:36:11,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:12,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002912086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:14,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 19] total 41 [2025-03-16 21:36:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191271087] [2025-03-16 21:36:14,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 21:36:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:14,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 21:36:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 21:36:14,045 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand has 42 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:17,098 INFO L93 Difference]: Finished difference Result 393 states and 542 transitions. [2025-03-16 21:36:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 21:36:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 21:36:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:17,099 INFO L225 Difference]: With dead ends: 393 [2025-03-16 21:36:17,099 INFO L226 Difference]: Without dead ends: 319 [2025-03-16 21:36:17,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1476, Invalid=6714, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 21:36:17,102 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1317 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:17,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 909 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 21:36:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-16 21:36:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 167. [2025-03-16 21:36:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.3674698795180722) internal successors, (227), 166 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 227 transitions. [2025-03-16 21:36:17,117 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 227 transitions. Word has length 36 [2025-03-16 21:36:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:17,118 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 227 transitions. [2025-03-16 21:36:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 227 transitions. [2025-03-16 21:36:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 21:36:17,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:17,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:17,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 21:36:17,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-16 21:36:17,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:17,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -850330352, now seen corresponding path program 1 times [2025-03-16 21:36:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181314982] [2025-03-16 21:36:17,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:17,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:17,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 21:36:17,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 21:36:17,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:17,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181314982] [2025-03-16 21:36:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181314982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068448077] [2025-03-16 21:36:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:17,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:17,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:17,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:17,740 INFO L87 Difference]: Start difference. First operand 167 states and 227 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:17,846 INFO L93 Difference]: Finished difference Result 230 states and 315 transitions. [2025-03-16 21:36:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:36:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 21:36:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:17,848 INFO L225 Difference]: With dead ends: 230 [2025-03-16 21:36:17,848 INFO L226 Difference]: Without dead ends: 175 [2025-03-16 21:36:17,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:36:17,849 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 87 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:17,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 164 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-16 21:36:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2025-03-16 21:36:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3630952380952381) internal successors, (229), 168 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 229 transitions. [2025-03-16 21:36:17,861 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 229 transitions. Word has length 36 [2025-03-16 21:36:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:17,861 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 229 transitions. [2025-03-16 21:36:17,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:17,861 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 229 transitions. [2025-03-16 21:36:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 21:36:17,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:17,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:17,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:36:17,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:17,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1826837856, now seen corresponding path program 1 times [2025-03-16 21:36:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102297051] [2025-03-16 21:36:17,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:17,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 21:36:17,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 21:36:17,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:17,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102297051] [2025-03-16 21:36:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102297051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:18,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:18,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:36:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194276827] [2025-03-16 21:36:18,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:18,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:36:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:18,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:36:18,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:36:18,237 INFO L87 Difference]: Start difference. First operand 169 states and 229 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:18,328 INFO L93 Difference]: Finished difference Result 285 states and 389 transitions. [2025-03-16 21:36:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:36:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-16 21:36:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:18,329 INFO L225 Difference]: With dead ends: 285 [2025-03-16 21:36:18,329 INFO L226 Difference]: Without dead ends: 175 [2025-03-16 21:36:18,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:18,330 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:18,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 167 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-16 21:36:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2025-03-16 21:36:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3571428571428572) internal successors, (228), 168 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 228 transitions. [2025-03-16 21:36:18,334 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 228 transitions. Word has length 37 [2025-03-16 21:36:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:18,334 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 228 transitions. [2025-03-16 21:36:18,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 228 transitions. [2025-03-16 21:36:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 21:36:18,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:18,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:18,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:36:18,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:18,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 178524461, now seen corresponding path program 1 times [2025-03-16 21:36:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876854302] [2025-03-16 21:36:18,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:18,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-16 21:36:18,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-16 21:36:18,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:18,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:18,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876854302] [2025-03-16 21:36:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876854302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245034340] [2025-03-16 21:36:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:18,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:18,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:18,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:18,692 INFO L87 Difference]: Start difference. First operand 169 states and 228 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:18,773 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2025-03-16 21:36:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:36:18,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 21:36:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:18,774 INFO L225 Difference]: With dead ends: 230 [2025-03-16 21:36:18,775 INFO L226 Difference]: Without dead ends: 118 [2025-03-16 21:36:18,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:36:18,776 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:18,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 226 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-16 21:36:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2025-03-16 21:36:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 111 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 150 transitions. [2025-03-16 21:36:18,783 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 150 transitions. Word has length 38 [2025-03-16 21:36:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:18,783 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 150 transitions. [2025-03-16 21:36:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2025-03-16 21:36:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 21:36:18,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:18,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:18,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:36:18,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:18,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash 503247420, now seen corresponding path program 1 times [2025-03-16 21:36:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:18,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114872076] [2025-03-16 21:36:18,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:18,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 21:36:18,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 21:36:18,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114872076] [2025-03-16 21:36:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114872076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240490926] [2025-03-16 21:36:19,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:19,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:19,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 21:36:19,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 21:36:19,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 21:36:19,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:19,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:19,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-16 21:36:19,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:19,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240490926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:19,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:19,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2025-03-16 21:36:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024386345] [2025-03-16 21:36:19,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:19,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 21:36:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:19,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 21:36:19,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-16 21:36:19,744 INFO L87 Difference]: Start difference. First operand 112 states and 150 transitions. Second operand has 24 states, 24 states have (on average 5.875) internal successors, (141), 23 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:20,284 INFO L93 Difference]: Finished difference Result 295 states and 405 transitions. [2025-03-16 21:36:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 21:36:20,284 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.875) internal successors, (141), 23 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 21:36:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:20,285 INFO L225 Difference]: With dead ends: 295 [2025-03-16 21:36:20,285 INFO L226 Difference]: Without dead ends: 211 [2025-03-16 21:36:20,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 21:36:20,286 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 431 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:20,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 416 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:36:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-16 21:36:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 175. [2025-03-16 21:36:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.3160919540229885) internal successors, (229), 174 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 229 transitions. [2025-03-16 21:36:20,292 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 229 transitions. Word has length 55 [2025-03-16 21:36:20,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:20,293 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 229 transitions. [2025-03-16 21:36:20,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.875) internal successors, (141), 23 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 229 transitions. [2025-03-16 21:36:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 21:36:20,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:20,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:20,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 21:36:20,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:20,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 73346826, now seen corresponding path program 1 times [2025-03-16 21:36:20,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537715567] [2025-03-16 21:36:20,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:20,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 21:36:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 21:36:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:20,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 21:36:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537715567] [2025-03-16 21:36:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537715567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:21,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:36:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336572023] [2025-03-16 21:36:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:21,011 INFO L87 Difference]: Start difference. First operand 175 states and 229 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:21,115 INFO L93 Difference]: Finished difference Result 344 states and 453 transitions. [2025-03-16 21:36:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:36:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 21:36:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:21,116 INFO L225 Difference]: With dead ends: 344 [2025-03-16 21:36:21,116 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 21:36:21,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:36:21,117 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:21,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 112 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 21:36:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2025-03-16 21:36:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3155080213903743) internal successors, (246), 187 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2025-03-16 21:36:21,122 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 56 [2025-03-16 21:36:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:21,122 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2025-03-16 21:36:21,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2025-03-16 21:36:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 21:36:21,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:21,122 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:21,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:36:21,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:21,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1501613087, now seen corresponding path program 1 times [2025-03-16 21:36:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605589798] [2025-03-16 21:36:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:21,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:36:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:36:21,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:21,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605589798] [2025-03-16 21:36:21,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605589798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:21,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508346617] [2025-03-16 21:36:21,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:21,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:21,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:21,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:21,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 21:36:21,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:36:21,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:36:21,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:21,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:21,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-16 21:36:21,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:21,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508346617] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:22,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 23 [2025-03-16 21:36:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859029393] [2025-03-16 21:36:22,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 21:36:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:22,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 21:36:22,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-16 21:36:22,327 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 24 states, 24 states have (on average 6.333333333333333) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:22,635 INFO L93 Difference]: Finished difference Result 376 states and 492 transitions. [2025-03-16 21:36:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:36:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.333333333333333) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 21:36:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:22,636 INFO L225 Difference]: With dead ends: 376 [2025-03-16 21:36:22,636 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 21:36:22,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 21:36:22,637 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 272 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 323 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:36:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 21:36:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2025-03-16 21:36:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3101604278074865) internal successors, (245), 187 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2025-03-16 21:36:22,642 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 57 [2025-03-16 21:36:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2025-03-16 21:36:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.333333333333333) internal successors, (152), 23 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2025-03-16 21:36:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 21:36:22,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:22,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:22,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 21:36:22,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:22,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:22,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2001561807, now seen corresponding path program 1 times [2025-03-16 21:36:22,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:22,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483552443] [2025-03-16 21:36:22,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:22,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:36:22,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:36:22,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:22,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483552443] [2025-03-16 21:36:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483552443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077009882] [2025-03-16 21:36:23,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:23,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:23,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:23,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 21:36:23,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:36:23,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:36:23,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:23,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:23,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-16 21:36:23,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:24,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077009882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:29,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 24] total 52 [2025-03-16 21:36:29,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386237122] [2025-03-16 21:36:29,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:29,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-16 21:36:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:29,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-16 21:36:29,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2475, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 21:36:29,018 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand has 53 states, 53 states have (on average 2.811320754716981) internal successors, (149), 52 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:30,168 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2025-03-16 21:36:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 21:36:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.811320754716981) internal successors, (149), 52 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-16 21:36:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:30,169 INFO L225 Difference]: With dead ends: 385 [2025-03-16 21:36:30,169 INFO L226 Difference]: Without dead ends: 224 [2025-03-16 21:36:30,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=464, Invalid=4092, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 21:36:30,171 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 73 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:30,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 441 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:36:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-16 21:36:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 197. [2025-03-16 21:36:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.2857142857142858) internal successors, (252), 196 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 252 transitions. [2025-03-16 21:36:30,177 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 252 transitions. Word has length 57 [2025-03-16 21:36:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:30,177 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 252 transitions. [2025-03-16 21:36:30,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.811320754716981) internal successors, (149), 52 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 252 transitions. [2025-03-16 21:36:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 21:36:30,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:30,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:30,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 21:36:30,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 21:36:30,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:30,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 200576015, now seen corresponding path program 1 times [2025-03-16 21:36:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:30,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-16 21:36:30,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:30,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:36:30,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:36:30,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:30,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:30,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-16 21:36:30,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167406220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:30,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431206192] [2025-03-16 21:36:30,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:30,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:30,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 21:36:30,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:36:30,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:36:30,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:30,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-16 21:36:30,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:31,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431206192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:31,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 29 [2025-03-16 21:36:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38268571] [2025-03-16 21:36:31,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 21:36:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:31,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 21:36:31,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2025-03-16 21:36:31,910 INFO L87 Difference]: Start difference. First operand 197 states and 252 transitions. Second operand has 30 states, 30 states have (on average 5.166666666666667) internal successors, (155), 29 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:32,793 INFO L93 Difference]: Finished difference Result 500 states and 661 transitions. [2025-03-16 21:36:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-16 21:36:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.166666666666667) internal successors, (155), 29 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 21:36:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:32,794 INFO L225 Difference]: With dead ends: 500 [2025-03-16 21:36:32,794 INFO L226 Difference]: Without dead ends: 401 [2025-03-16 21:36:32,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=410, Invalid=2560, Unknown=0, NotChecked=0, Total=2970 [2025-03-16 21:36:32,796 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 464 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:32,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 526 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:36:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-16 21:36:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 315. [2025-03-16 21:36:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.3121019108280254) internal successors, (412), 314 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 412 transitions. [2025-03-16 21:36:32,809 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 412 transitions. Word has length 58 [2025-03-16 21:36:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:32,809 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 412 transitions. [2025-03-16 21:36:32,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.166666666666667) internal successors, (155), 29 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 412 transitions. [2025-03-16 21:36:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 21:36:32,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:32,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:32,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 21:36:33,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 21:36:33,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash 282961124, now seen corresponding path program 1 times [2025-03-16 21:36:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:33,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918827662] [2025-03-16 21:36:33,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:33,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:33,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:36:33,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:36:33,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:33,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:33,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918827662] [2025-03-16 21:36:33,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918827662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:33,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711701086] [2025-03-16 21:36:33,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:33,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:33,693 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:33,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 21:36:33,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:36:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:36:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:33,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-16 21:36:33,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:34,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:35,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711701086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:35,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:35,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 20] total 50 [2025-03-16 21:36:35,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123873065] [2025-03-16 21:36:35,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:35,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-16 21:36:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:35,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-16 21:36:35,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=1964, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 21:36:35,257 INFO L87 Difference]: Start difference. First operand 315 states and 412 transitions. Second operand has 50 states, 50 states have (on average 3.24) internal successors, (162), 50 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:37,761 INFO L93 Difference]: Finished difference Result 739 states and 1001 transitions. [2025-03-16 21:36:37,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-16 21:36:37,761 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.24) internal successors, (162), 50 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 21:36:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:37,762 INFO L225 Difference]: With dead ends: 739 [2025-03-16 21:36:37,762 INFO L226 Difference]: Without dead ends: 468 [2025-03-16 21:36:37,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2447, Invalid=13053, Unknown=0, NotChecked=0, Total=15500 [2025-03-16 21:36:37,766 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 852 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:37,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 377 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:36:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-16 21:36:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 305. [2025-03-16 21:36:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.325657894736842) internal successors, (403), 304 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 403 transitions. [2025-03-16 21:36:37,774 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 403 transitions. Word has length 59 [2025-03-16 21:36:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:37,774 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 403 transitions. [2025-03-16 21:36:37,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.24) internal successors, (162), 50 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 403 transitions. [2025-03-16 21:36:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 21:36:37,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:37,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:37,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 21:36:37,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:37,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:37,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2118407039, now seen corresponding path program 1 times [2025-03-16 21:36:37,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:37,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-03-16 21:36:37,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:37,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:37,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 21:36:38,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 21:36:38,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:38,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967057189] [2025-03-16 21:36:38,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967057189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925731314] [2025-03-16 21:36:38,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:38,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:38,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:38,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:38,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 21:36:39,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 21:36:39,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 21:36:39,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:39,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:39,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-16 21:36:39,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:39,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:40,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925731314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:40,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 23] total 57 [2025-03-16 21:36:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632551621] [2025-03-16 21:36:40,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-16 21:36:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:40,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-16 21:36:40,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=2775, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 21:36:40,869 INFO L87 Difference]: Start difference. First operand 305 states and 403 transitions. Second operand has 58 states, 58 states have (on average 2.913793103448276) internal successors, (169), 57 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:42,133 INFO L93 Difference]: Finished difference Result 599 states and 795 transitions. [2025-03-16 21:36:42,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-16 21:36:42,134 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.913793103448276) internal successors, (169), 57 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 21:36:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:42,135 INFO L225 Difference]: With dead ends: 599 [2025-03-16 21:36:42,135 INFO L226 Difference]: Without dead ends: 385 [2025-03-16 21:36:42,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=960, Invalid=5360, Unknown=0, NotChecked=0, Total=6320 [2025-03-16 21:36:42,137 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 419 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:42,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 921 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:36:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-16 21:36:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 360. [2025-03-16 21:36:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.317548746518106) internal successors, (473), 359 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2025-03-16 21:36:42,147 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 60 [2025-03-16 21:36:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:42,147 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2025-03-16 21:36:42,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.913793103448276) internal successors, (169), 57 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2025-03-16 21:36:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 21:36:42,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:42,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:42,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 21:36:42,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 21:36:42,349 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash 699892422, now seen corresponding path program 1 times [2025-03-16 21:36:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668905415] [2025-03-16 21:36:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:42,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 21:36:42,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 21:36:42,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:42,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668905415] [2025-03-16 21:36:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668905415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:36:42,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214203389] [2025-03-16 21:36:42,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:42,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:36:42,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:42,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:36:42,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:36:42,605 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:42,699 INFO L93 Difference]: Finished difference Result 679 states and 892 transitions. [2025-03-16 21:36:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:42,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-16 21:36:42,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:42,701 INFO L225 Difference]: With dead ends: 679 [2025-03-16 21:36:42,701 INFO L226 Difference]: Without dead ends: 350 [2025-03-16 21:36:42,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:36:42,702 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:42,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 405 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:42,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-16 21:36:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 325. [2025-03-16 21:36:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.287037037037037) internal successors, (417), 324 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 417 transitions. [2025-03-16 21:36:42,711 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 417 transitions. Word has length 60 [2025-03-16 21:36:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:42,712 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 417 transitions. [2025-03-16 21:36:42,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 417 transitions. [2025-03-16 21:36:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 21:36:42,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:42,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:36:42,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 76253321, now seen corresponding path program 1 times [2025-03-16 21:36:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443449470] [2025-03-16 21:36:42,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:42,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:36:42,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:36:42,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:42,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 21:36:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443449470] [2025-03-16 21:36:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443449470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199133913] [2025-03-16 21:36:43,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:43,089 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:43,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 21:36:43,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:36:43,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:36:43,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:43,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:43,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-16 21:36:43,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 21:36:43,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199133913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:44,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:36:44,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 18] total 38 [2025-03-16 21:36:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671525635] [2025-03-16 21:36:44,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:44,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 21:36:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:44,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 21:36:44,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 21:36:44,297 INFO L87 Difference]: Start difference. First operand 325 states and 417 transitions. Second operand has 39 states, 39 states have (on average 4.0256410256410255) internal successors, (157), 38 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:45,101 INFO L93 Difference]: Finished difference Result 738 states and 959 transitions. [2025-03-16 21:36:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 21:36:45,102 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.0256410256410255) internal successors, (157), 38 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 21:36:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:45,103 INFO L225 Difference]: With dead ends: 738 [2025-03-16 21:36:45,103 INFO L226 Difference]: Without dead ends: 489 [2025-03-16 21:36:45,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=726, Invalid=2696, Unknown=0, NotChecked=0, Total=3422 [2025-03-16 21:36:45,104 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 309 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:45,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 407 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:36:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-16 21:36:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 331. [2025-03-16 21:36:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.2818181818181817) internal successors, (423), 330 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 423 transitions. [2025-03-16 21:36:45,112 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 423 transitions. Word has length 61 [2025-03-16 21:36:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:45,112 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 423 transitions. [2025-03-16 21:36:45,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.0256410256410255) internal successors, (157), 38 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 423 transitions. [2025-03-16 21:36:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 21:36:45,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:45,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:45,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 21:36:45,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:45,314 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1465690521, now seen corresponding path program 1 times [2025-03-16 21:36:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624882016] [2025-03-16 21:36:45,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:45,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:36:45,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:36:45,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:45,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:36:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624882016] [2025-03-16 21:36:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624882016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203977965] [2025-03-16 21:36:45,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:45,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:45,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:45,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:45,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 21:36:46,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 21:36:46,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 21:36:46,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:46,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-16 21:36:46,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:46,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 21:36:46,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203977965] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 21:36:46,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:36:46,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 13] total 32 [2025-03-16 21:36:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583126296] [2025-03-16 21:36:46,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:46,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:36:46,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:36:46,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:36:46,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2025-03-16 21:36:46,745 INFO L87 Difference]: Start difference. First operand 331 states and 423 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:46,882 INFO L93 Difference]: Finished difference Result 888 states and 1152 transitions. [2025-03-16 21:36:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:36:46,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 21:36:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:46,884 INFO L225 Difference]: With dead ends: 888 [2025-03-16 21:36:46,884 INFO L226 Difference]: Without dead ends: 633 [2025-03-16 21:36:46,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 21:36:46,885 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 50 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:46,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 364 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:36:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-16 21:36:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 625. [2025-03-16 21:36:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.2932692307692308) internal successors, (807), 624 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 807 transitions. [2025-03-16 21:36:46,897 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 807 transitions. Word has length 61 [2025-03-16 21:36:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 807 transitions. [2025-03-16 21:36:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 807 transitions. [2025-03-16 21:36:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 21:36:46,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:46,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:46,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 21:36:47,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:47,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1411660050, now seen corresponding path program 1 times [2025-03-16 21:36:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:36:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041876355] [2025-03-16 21:36:47,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:36:47,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 21:36:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 21:36:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:36:47,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:36:47,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 21:36:47,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 21:36:47,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:36:47,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:36:47,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:36:47,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:36:47,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:36:47,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:36:47,351 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:36:47,351 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:36:47,352 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:36:47,359 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:36:47,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:36:47 BoogieIcfgContainer [2025-03-16 21:36:47,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:36:47,366 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:36:47,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:36:47,366 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:36:47,367 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:07" (3/4) ... [2025-03-16 21:36:47,368 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:36:47,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:36:47,369 INFO L158 Benchmark]: Toolchain (without parser) took 40208.35ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 105.9MB in the beginning and 530.3MB in the end (delta: -424.4MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2025-03-16 21:36:47,369 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:36:47,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.28ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 92.8MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 21:36:47,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.43ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 87.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:36:47,370 INFO L158 Benchmark]: Boogie Preprocessor took 59.05ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:36:47,370 INFO L158 Benchmark]: IcfgBuilder took 428.41ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 54.9MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 21:36:47,370 INFO L158 Benchmark]: TraceAbstraction took 39420.28ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 53.8MB in the beginning and 530.5MB in the end (delta: -476.7MB). Peak memory consumption was 309.9MB. Max. memory is 16.1GB. [2025-03-16 21:36:47,370 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 604.0MB. Free memory was 530.5MB in the beginning and 530.3MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:36:47,371 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.28ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 92.8MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.43ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 87.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.05ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 428.41ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 54.9MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39420.28ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 53.8MB in the beginning and 530.5MB in the end (delta: -476.7MB). Peak memory consumption was 309.9MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 604.0MB. Free memory was 530.5MB in the beginning and 530.3MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 89, overapproximation of bitwiseAnd at line 115. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=1, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_26=1, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_34=1, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.3s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4869 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4869 mSDsluCounter, 6909 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6050 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12644 IncrementalHoareTripleChecker+Invalid, 12790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 859 mSDtfsCounter, 12644 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1482 GetRequests, 831 SyntacticMatches, 1 SemanticMatches, 650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11982 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=20, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 825 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1875 ConstructedInterpolants, 0 QuantifiedInterpolants, 24092 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3932 ConjunctsInSsa, 848 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 593/897 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 21:36:47,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:36:49,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:36:49,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:36:49,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:36:49,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:36:49,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:36:49,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:36:49,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:36:49,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:36:49,284 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:36:49,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:36:49,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:36:49,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:36:49,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:36:49,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:36:49,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:36:49,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:49,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:36:49,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:36:49,287 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2025-03-16 21:36:49,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:36:49,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:36:49,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:36:49,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:36:49,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:36:49,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-16 21:36:50,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8bda3e2/2cd3f3c6ffb44578a82707cd13da1089/FLAGcdfe04ee6 [2025-03-16 21:36:50,874 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:36:50,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2025-03-16 21:36:50,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8bda3e2/2cd3f3c6ffb44578a82707cd13da1089/FLAGcdfe04ee6 [2025-03-16 21:36:50,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8bda3e2/2cd3f3c6ffb44578a82707cd13da1089 [2025-03-16 21:36:50,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:36:50,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:36:50,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:50,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:36:50,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:36:50,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:50" (1/1) ... [2025-03-16 21:36:50,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d274bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:50, skipping insertion in model container [2025-03-16 21:36:50,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:36:50" (1/1) ... [2025-03-16 21:36:50,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:36:51,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2025-03-16 21:36:51,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:51,080 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:36:51,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2025-03-16 21:36:51,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:36:51,127 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:36:51,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51 WrapperNode [2025-03-16 21:36:51,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:36:51,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:51,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:36:51,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:36:51,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,152 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2025-03-16 21:36:51,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:36:51,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:36:51,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:36:51,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:36:51,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,178 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:36:51,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:36:51,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:36:51,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:36:51,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:36:51,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (1/1) ... [2025-03-16 21:36:51,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:36:51,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:51,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 21:36:51,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 21:36:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:36:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:36:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:36:51,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:36:51,307 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:36:51,309 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:36:51,444 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-16 21:36:51,445 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:36:51,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:36:51,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:36:51,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:51 BoogieIcfgContainer [2025-03-16 21:36:51,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:36:51,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:36:51,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:36:51,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:36:51,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:36:50" (1/3) ... [2025-03-16 21:36:51,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25927c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:51, skipping insertion in model container [2025-03-16 21:36:51,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:36:51" (2/3) ... [2025-03-16 21:36:51,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25927c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:36:51, skipping insertion in model container [2025-03-16 21:36:51,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:36:51" (3/3) ... [2025-03-16 21:36:51,461 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2025-03-16 21:36:51,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:36:51,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cav14_example_v.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:36:51,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:36:51,506 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e5495a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:36:51,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:36:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:36:51,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:51,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:36:51,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:36:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:51,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1356872685] [2025-03-16 21:36:51,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:51,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:51,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:51,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 21:36:51,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:36:51,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:36:51,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:51,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:51,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 21:36:51,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:51,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:36:51,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:36:51,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356872685] [2025-03-16 21:36:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356872685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:36:51,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:36:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:36:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953229703] [2025-03-16 21:36:51,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:36:51,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:36:51,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:36:51,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:36:51,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:36:51,794 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:51,823 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:36:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:36:51,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-16 21:36:51,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:51,829 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:36:51,829 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:36:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:36:51,833 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:36:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:36:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:36:51,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:36:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:51,852 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:36:51,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:36:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:36:51,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:51,853 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:36:51,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 21:36:52,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:52,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:36:52,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:52,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32974306] [2025-03-16 21:36:52,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:36:52,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:52,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:52,060 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:52,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 21:36:52,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:36:52,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:36:52,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:36:52,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:52,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 21:36:52,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:52,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:53,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:36:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32974306] [2025-03-16 21:36:53,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32974306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:53,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:36:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:36:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413294629] [2025-03-16 21:36:53,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:53,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:36:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:36:53,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:36:53,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:36:53,288 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:53,406 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-16 21:36:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:36:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 21:36:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:53,407 INFO L225 Difference]: With dead ends: 17 [2025-03-16 21:36:53,407 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 21:36:53,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:36:53,408 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:53,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:36:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 21:36:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-16 21:36:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-16 21:36:53,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-03-16 21:36:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:53,411 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-16 21:36:53,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-16 21:36:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 21:36:53,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:53,412 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-03-16 21:36:53,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 21:36:53,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:53,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:53,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-03-16 21:36:53,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:53,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1005219959] [2025-03-16 21:36:53,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:36:53,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:53,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:53,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 21:36:53,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-16 21:36:53,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 21:36:53,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:36:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:36:53,697 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 21:36:53,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:36:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:54,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:36:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:36:58,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:36:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005219959] [2025-03-16 21:36:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005219959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:36:58,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:36:58,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2025-03-16 21:36:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425219200] [2025-03-16 21:36:58,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:36:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 21:36:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:36:58,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 21:36:58,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-16 21:36:58,830 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:36:59,782 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-16 21:36:59,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 21:36:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-16 21:36:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:36:59,783 INFO L225 Difference]: With dead ends: 29 [2025-03-16 21:36:59,783 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 21:36:59,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2025-03-16 21:36:59,784 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:36:59,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 20 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:36:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 21:36:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-16 21:36:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-03-16 21:36:59,788 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-03-16 21:36:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:36:59,788 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-03-16 21:36:59,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:36:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-03-16 21:36:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 21:36:59,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:36:59,788 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2025-03-16 21:36:59,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 21:36:59,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:59,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:36:59,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:36:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1857839369, now seen corresponding path program 3 times [2025-03-16 21:36:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:36:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046619315] [2025-03-16 21:36:59,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 21:36:59,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:36:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:36:59,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:36:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 21:37:00,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-03-16 21:37:00,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 21:37:00,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-16 21:37:00,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:37:00,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-16 21:37:00,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:37:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:37:00,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:37:22,845 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 481 DAG size of output: 366 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)