./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.cal45.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 7ffa7211fa1cbf66ca75ab73473062c0fcd7b10c25684a139cdd65fcb3c9a5dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:08:06,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:08:06,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:08:06,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:08:06,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:08:06,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:08:06,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:08:06,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:08:06,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:08:06,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:08:06,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:08:06,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:08:06,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:08:06,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:08:06,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:08:06,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:08:06,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:08:06,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:08:06,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:08:06,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:08:06,231 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 -> 7ffa7211fa1cbf66ca75ab73473062c0fcd7b10c25684a139cdd65fcb3c9a5dd [2025-03-03 17:08:06,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:08:06,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:08:06,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:08:06,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:08:06,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:08:06,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c [2025-03-03 17:08:07,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072b9ee99/255298e264ae4b03a2e7947311abd804/FLAG70a832651 [2025-03-03 17:08:08,240 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:08:08,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal45.c [2025-03-03 17:08:08,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072b9ee99/255298e264ae4b03a2e7947311abd804/FLAG70a832651 [2025-03-03 17:08:08,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072b9ee99/255298e264ae4b03a2e7947311abd804 [2025-03-03 17:08:08,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:08:08,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:08:08,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:08:08,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:08:08,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:08:08,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:08:08" (1/1) ... [2025-03-03 17:08:08,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:08, skipping insertion in model container [2025-03-03 17:08:08,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:08:08" (1/1) ... [2025-03-03 17:08:08,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:08:09,041 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.cal45.c[1245,1258] [2025-03-03 17:08:09,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:08:09,957 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:08:09,966 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.cal45.c[1245,1258] [2025-03-03 17:08:10,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:08:10,555 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:08:10,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10 WrapperNode [2025-03-03 17:08:10,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:08:10,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:08:10,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:08:10,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:08:10,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:10,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:13,155 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36437 [2025-03-03 17:08:13,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:08:13,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:08:13,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:08:13,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:08:13,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:13,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:14,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:14,705 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:08:14,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:14,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:15,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:15,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:15,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:15,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:16,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:08:16,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:08:16,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:08:16,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:08:16,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (1/1) ... [2025-03-03 17:08:16,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:08:16,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:08:16,290 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-03 17:08:16,292 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-03 17:08:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:08:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:08:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:08:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:08:16,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:08:17,473 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:08:17,475 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:09:18,080 INFO L? ?]: Removed 20150 outVars from TransFormulas that were not future-live. [2025-03-03 17:09:18,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:09:18,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:09:18,651 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:09:18,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:18 BoogieIcfgContainer [2025-03-03 17:09:18,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:09:18,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:09:18,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:09:18,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:09:18,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:08:08" (1/3) ... [2025-03-03 17:09:18,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41f6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:18, skipping insertion in model container [2025-03-03 17:09:18,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:08:10" (2/3) ... [2025-03-03 17:09:18,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c41f6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:09:18, skipping insertion in model container [2025-03-03 17:09:18,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:09:18" (3/3) ... [2025-03-03 17:09:18,660 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal45.c [2025-03-03 17:09:18,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:09:18,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal45.c that has 1 procedures, 12490 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:09:18,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:09:18,866 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;@55517ece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:09:18,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:09:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 12490 states, 12488 states have (on average 1.5004003843689941) internal successors, (18737), 12489 states have internal predecessors, (18737), 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-03 17:09:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 17:09:18,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:18,912 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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-03 17:09:18,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:18,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 12234948, now seen corresponding path program 1 times [2025-03-03 17:09:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359240081] [2025-03-03 17:09:18,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:19,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 17:09:19,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 17:09:19,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:19,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:20,110 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-03 17:09:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359240081] [2025-03-03 17:09:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359240081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528341591] [2025-03-03 17:09:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:20,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:20,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:20,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:20,161 INFO L87 Difference]: Start difference. First operand has 12490 states, 12488 states have (on average 1.5004003843689941) internal successors, (18737), 12489 states have internal predecessors, (18737), 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 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-03 17:09:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:24,571 INFO L93 Difference]: Finished difference Result 24829 states and 37251 transitions. [2025-03-03 17:09:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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 191 [2025-03-03 17:09:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:24,621 INFO L225 Difference]: With dead ends: 24829 [2025-03-03 17:09:24,621 INFO L226 Difference]: Without dead ends: 12489 [2025-03-03 17:09:24,642 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-03 17:09:24,645 INFO L435 NwaCegarLoop]: 15614 mSDtfsCounter, 0 mSDsluCounter, 31223 mSDsCounter, 0 mSdLazyCounter, 9361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46837 SdHoareTripleChecker+Invalid, 9361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:24,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46837 Invalid, 9361 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9361 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 17:09:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12489 states. [2025-03-03 17:09:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12489 to 12489. [2025-03-03 17:09:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12489 states, 12488 states have (on average 1.5002402306213964) internal successors, (18735), 12488 states have internal predecessors, (18735), 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-03 17:09:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12489 states to 12489 states and 18735 transitions. [2025-03-03 17:09:24,942 INFO L78 Accepts]: Start accepts. Automaton has 12489 states and 18735 transitions. Word has length 191 [2025-03-03 17:09:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:24,945 INFO L471 AbstractCegarLoop]: Abstraction has 12489 states and 18735 transitions. [2025-03-03 17:09:24,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-03 17:09:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 12489 states and 18735 transitions. [2025-03-03 17:09:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 17:09:24,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:24,951 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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-03 17:09:24,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:09:24,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash 383983725, now seen corresponding path program 1 times [2025-03-03 17:09:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:24,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215802063] [2025-03-03 17:09:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:24,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:25,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 17:09:25,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 17:09:25,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:25,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:25,447 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-03 17:09:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215802063] [2025-03-03 17:09:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215802063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575801745] [2025-03-03 17:09:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:25,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:25,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:25,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:25,452 INFO L87 Difference]: Start difference. First operand 12489 states and 18735 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-03 17:09:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:29,391 INFO L93 Difference]: Finished difference Result 24830 states and 37249 transitions. [2025-03-03 17:09:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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 192 [2025-03-03 17:09:29,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:29,423 INFO L225 Difference]: With dead ends: 24830 [2025-03-03 17:09:29,423 INFO L226 Difference]: Without dead ends: 12491 [2025-03-03 17:09:29,436 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-03 17:09:29,436 INFO L435 NwaCegarLoop]: 15614 mSDtfsCounter, 0 mSDsluCounter, 31220 mSDsCounter, 0 mSdLazyCounter, 9364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46834 SdHoareTripleChecker+Invalid, 9364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:29,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46834 Invalid, 9364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9364 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 17:09:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2025-03-03 17:09:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 12491. [2025-03-03 17:09:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12491 states, 12490 states have (on average 1.500160128102482) internal successors, (18737), 12490 states have internal predecessors, (18737), 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-03 17:09:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 18737 transitions. [2025-03-03 17:09:29,629 INFO L78 Accepts]: Start accepts. Automaton has 12491 states and 18737 transitions. Word has length 192 [2025-03-03 17:09:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 12491 states and 18737 transitions. [2025-03-03 17:09:29,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-03 17:09:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12491 states and 18737 transitions. [2025-03-03 17:09:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 17:09:29,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:29,634 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1] [2025-03-03 17:09:29,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:09:29,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:29,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:29,637 INFO L85 PathProgramCache]: Analyzing trace with hash 950123999, now seen corresponding path program 1 times [2025-03-03 17:09:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:29,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170833265] [2025-03-03 17:09:29,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:29,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 17:09:29,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 17:09:29,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:09:29,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:09:30,486 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-03 17:09:30,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:09:30,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170833265] [2025-03-03 17:09:30,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170833265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:09:30,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:09:30,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:09:30,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579264318] [2025-03-03 17:09:30,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:09:30,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:09:30,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:09:30,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:09:30,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:09:30,489 INFO L87 Difference]: Start difference. First operand 12491 states and 18737 transitions. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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-03 17:09:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:09:34,458 INFO L93 Difference]: Finished difference Result 24832 states and 37250 transitions. [2025-03-03 17:09:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:09:34,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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 193 [2025-03-03 17:09:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:09:34,478 INFO L225 Difference]: With dead ends: 24832 [2025-03-03 17:09:34,479 INFO L226 Difference]: Without dead ends: 12491 [2025-03-03 17:09:34,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 17:09:34,495 INFO L435 NwaCegarLoop]: 15611 mSDtfsCounter, 113 mSDsluCounter, 31126 mSDsCounter, 0 mSdLazyCounter, 9343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 46737 SdHoareTripleChecker+Invalid, 9343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:09:34,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 46737 Invalid, 9343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 9343 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-03 17:09:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2025-03-03 17:09:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 12491. [2025-03-03 17:09:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12491 states, 12490 states have (on average 1.500080064051241) internal successors, (18736), 12490 states have internal predecessors, (18736), 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-03 17:09:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12491 states to 12491 states and 18736 transitions. [2025-03-03 17:09:34,664 INFO L78 Accepts]: Start accepts. Automaton has 12491 states and 18736 transitions. Word has length 193 [2025-03-03 17:09:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:09:34,664 INFO L471 AbstractCegarLoop]: Abstraction has 12491 states and 18736 transitions. [2025-03-03 17:09:34,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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-03 17:09:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 12491 states and 18736 transitions. [2025-03-03 17:09:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 17:09:34,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:09:34,665 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1] [2025-03-03 17:09:34,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:09:34,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:09:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:09:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2056067422, now seen corresponding path program 1 times [2025-03-03 17:09:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:09:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159114322] [2025-03-03 17:09:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:09:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:09:34,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.