./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:45:07,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:45:07,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:45:07,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:45:07,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:45:07,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:45:07,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:45:07,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:45:07,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:45:07,572 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:45:07,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:45:07,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:45:07,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:45:07,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:45:07,572 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:45:07,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:45:07,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:45:07,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:07,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:45:07,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:45:07,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:45:07,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:45:07,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:45:07,575 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-jdk21/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 -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2025-02-07 22:45:07,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:45:07,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:45:07,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:45:07,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:45:07,792 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:45:07,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-02-07 22:45:08,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61f57a89a/31338cc4f31f43b98fd53d8f4f87f1f1/FLAG6019cdd96 [2025-02-07 22:45:09,169 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:45:09,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-02-07 22:45:09,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61f57a89a/31338cc4f31f43b98fd53d8f4f87f1f1/FLAG6019cdd96 [2025-02-07 22:45:09,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61f57a89a/31338cc4f31f43b98fd53d8f4f87f1f1 [2025-02-07 22:45:09,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:45:09,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:45:09,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:09,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:45:09,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:45:09,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439cefaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09, skipping insertion in model container [2025-02-07 22:45:09,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:45:09,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2025-02-07 22:45:09,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:09,382 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:45:09,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2025-02-07 22:45:09,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:09,440 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:45:09,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09 WrapperNode [2025-02-07 22:45:09,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:09,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:09,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:45:09,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:45:09,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,509 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 369 [2025-02-07 22:45:09,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:09,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:45:09,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:45:09,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:45:09,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,547 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-02-07 22:45:09,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:45:09,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:45:09,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:45:09,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:45:09,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (1/1) ... [2025-02-07 22:45:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:09,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:09,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:45:09,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:45:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:45:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:45:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 22:45:09,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:45:09,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:45:09,697 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:45:09,701 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:45:10,086 INFO L? ?]: Removed 166 outVars from TransFormulas that were not future-live. [2025-02-07 22:45:10,086 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:45:10,110 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:45:10,111 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:45:10,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:10 BoogieIcfgContainer [2025-02-07 22:45:10,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:45:10,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:45:10,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:45:10,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:45:10,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:45:09" (1/3) ... [2025-02-07 22:45:10,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a689aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:10, skipping insertion in model container [2025-02-07 22:45:10,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:09" (2/3) ... [2025-02-07 22:45:10,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a689aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:10, skipping insertion in model container [2025-02-07 22:45:10,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:10" (3/3) ... [2025-02-07 22:45:10,118 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2025-02-07 22:45:10,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:45:10,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal51.c that has 1 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:45:10,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:45:10,173 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;@25f13517, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:45:10,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:45:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 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-02-07 22:45:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 22:45:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:10,180 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] [2025-02-07 22:45:10,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:10,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1010259878, now seen corresponding path program 1 times [2025-02-07 22:45:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820100653] [2025-02-07 22:45:10,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:10,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 22:45:10,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 22:45:10,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:10,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:10,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:10,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820100653] [2025-02-07 22:45:10,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820100653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:10,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403315707] [2025-02-07 22:45:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:10,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:10,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:10,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:10,778 INFO L87 Difference]: Start difference. First operand has 88 states, 86 states have (on average 1.5) internal successors, (129), 87 states have internal predecessors, (129), 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 9.5) internal successors, (38), 4 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-02-07 22:45:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:10,860 INFO L93 Difference]: Finished difference Result 159 states and 235 transitions. [2025-02-07 22:45:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:10,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-02-07 22:45:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:10,867 INFO L225 Difference]: With dead ends: 159 [2025-02-07 22:45:10,867 INFO L226 Difference]: Without dead ends: 88 [2025-02-07 22:45:10,869 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-02-07 22:45:10,871 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:10,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-07 22:45:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-07 22:45:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.471264367816092) internal successors, (128), 87 states have internal predecessors, (128), 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-02-07 22:45:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2025-02-07 22:45:10,897 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 38 [2025-02-07 22:45:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:10,897 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2025-02-07 22:45:10,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-02-07 22:45:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2025-02-07 22:45:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 22:45:10,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:10,899 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] [2025-02-07 22:45:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:45:10,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:10,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1248605982, now seen corresponding path program 1 times [2025-02-07 22:45:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:10,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707515154] [2025-02-07 22:45:10,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:10,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 22:45:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 22:45:10,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:10,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:11,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:11,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707515154] [2025-02-07 22:45:11,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707515154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:11,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:11,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:11,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905680966] [2025-02-07 22:45:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:11,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:11,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:11,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:11,099 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-02-07 22:45:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:11,168 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2025-02-07 22:45:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:11,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2025-02-07 22:45:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:11,170 INFO L225 Difference]: With dead ends: 161 [2025-02-07 22:45:11,170 INFO L226 Difference]: Without dead ends: 90 [2025-02-07 22:45:11,170 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-02-07 22:45:11,170 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:11,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-07 22:45:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-07 22:45:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 89 states have internal predecessors, (130), 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-02-07 22:45:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2025-02-07 22:45:11,175 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 39 [2025-02-07 22:45:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:11,175 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2025-02-07 22:45:11,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-02-07 22:45:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2025-02-07 22:45:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 22:45:11,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:11,176 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] [2025-02-07 22:45:11,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:45:11,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1879429461, now seen corresponding path program 1 times [2025-02-07 22:45:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:11,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165432019] [2025-02-07 22:45:11,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:11,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 22:45:11,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 22:45:11,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:11,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:11,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165432019] [2025-02-07 22:45:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165432019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:11,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:11,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813902801] [2025-02-07 22:45:11,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:11,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:11,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:11,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:11,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:11,418 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-02-07 22:45:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:11,482 INFO L93 Difference]: Finished difference Result 163 states and 235 transitions. [2025-02-07 22:45:11,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:11,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2025-02-07 22:45:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:11,483 INFO L225 Difference]: With dead ends: 163 [2025-02-07 22:45:11,483 INFO L226 Difference]: Without dead ends: 90 [2025-02-07 22:45:11,484 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-02-07 22:45:11,484 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 29 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:11,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 277 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-07 22:45:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-07 22:45:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.449438202247191) internal successors, (129), 89 states have internal predecessors, (129), 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-02-07 22:45:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-02-07 22:45:11,488 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 40 [2025-02-07 22:45:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:11,488 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-02-07 22:45:11,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-02-07 22:45:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-02-07 22:45:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 22:45:11,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:11,489 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] [2025-02-07 22:45:11,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:45:11,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1291589637, now seen corresponding path program 1 times [2025-02-07 22:45:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185852395] [2025-02-07 22:45:11,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 22:45:11,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 22:45:11,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:11,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185852395] [2025-02-07 22:45:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185852395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:11,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:45:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225379844] [2025-02-07 22:45:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:45:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:45:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:11,770 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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-02-07 22:45:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:11,895 INFO L93 Difference]: Finished difference Result 167 states and 239 transitions. [2025-02-07 22:45:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:45:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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 41 [2025-02-07 22:45:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:11,896 INFO L225 Difference]: With dead ends: 167 [2025-02-07 22:45:11,896 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 22:45:11,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:45:11,897 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 142 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:11,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 427 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 22:45:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-07 22:45:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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-02-07 22:45:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2025-02-07 22:45:11,901 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 41 [2025-02-07 22:45:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2025-02-07 22:45:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 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-02-07 22:45:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2025-02-07 22:45:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 22:45:11,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:11,902 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] [2025-02-07 22:45:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:45:11,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:11,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:11,902 INFO L85 PathProgramCache]: Analyzing trace with hash -695358422, now seen corresponding path program 1 times [2025-02-07 22:45:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562889850] [2025-02-07 22:45:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:11,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 22:45:11,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 22:45:11,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:11,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:12,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562889850] [2025-02-07 22:45:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562889850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:12,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:12,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:12,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170715184] [2025-02-07 22:45:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:12,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:12,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:12,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:12,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:12,004 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-07 22:45:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:12,048 INFO L93 Difference]: Finished difference Result 172 states and 243 transitions. [2025-02-07 22:45:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:12,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2025-02-07 22:45:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:12,049 INFO L225 Difference]: With dead ends: 172 [2025-02-07 22:45:12,049 INFO L226 Difference]: Without dead ends: 96 [2025-02-07 22:45:12,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-07 22:45:12,050 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:12,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-07 22:45:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-07 22:45:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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-02-07 22:45:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2025-02-07 22:45:12,058 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 42 [2025-02-07 22:45:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:12,059 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2025-02-07 22:45:12,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-07 22:45:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2025-02-07 22:45:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 22:45:12,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:12,059 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] [2025-02-07 22:45:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:45:12,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash -108806401, now seen corresponding path program 1 times [2025-02-07 22:45:12,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:12,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401767356] [2025-02-07 22:45:12,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:12,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:12,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 22:45:12,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 22:45:12,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:12,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401767356] [2025-02-07 22:45:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401767356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:12,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422172140] [2025-02-07 22:45:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:12,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:12,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:12,208 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-02-07 22:45:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:12,298 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2025-02-07 22:45:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2025-02-07 22:45:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:12,299 INFO L225 Difference]: With dead ends: 175 [2025-02-07 22:45:12,299 INFO L226 Difference]: Without dead ends: 96 [2025-02-07 22:45:12,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:12,300 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 112 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:12,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 127 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-07 22:45:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-07 22:45:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 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-02-07 22:45:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2025-02-07 22:45:12,304 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 43 [2025-02-07 22:45:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:12,304 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2025-02-07 22:45:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-02-07 22:45:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2025-02-07 22:45:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 22:45:12,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:12,305 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] [2025-02-07 22:45:12,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:45:12,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:12,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:12,306 INFO L85 PathProgramCache]: Analyzing trace with hash 978888684, now seen corresponding path program 1 times [2025-02-07 22:45:12,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:12,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255106803] [2025-02-07 22:45:12,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:12,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:12,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 22:45:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 22:45:12,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:12,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255106803] [2025-02-07 22:45:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255106803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:12,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61433561] [2025-02-07 22:45:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:12,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:12,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:12,507 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-02-07 22:45:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:12,634 INFO L93 Difference]: Finished difference Result 179 states and 249 transitions. [2025-02-07 22:45:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:12,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2025-02-07 22:45:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:12,636 INFO L225 Difference]: With dead ends: 179 [2025-02-07 22:45:12,636 INFO L226 Difference]: Without dead ends: 100 [2025-02-07 22:45:12,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:12,637 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 114 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:12,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 184 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-07 22:45:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-07 22:45:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 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-02-07 22:45:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2025-02-07 22:45:12,646 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 44 [2025-02-07 22:45:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:12,646 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2025-02-07 22:45:12,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-02-07 22:45:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2025-02-07 22:45:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 22:45:12,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:12,647 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] [2025-02-07 22:45:12,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:45:12,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:12,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1831790979, now seen corresponding path program 1 times [2025-02-07 22:45:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816501598] [2025-02-07 22:45:12,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:12,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 22:45:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 22:45:12,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816501598] [2025-02-07 22:45:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816501598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:45:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36132921] [2025-02-07 22:45:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:12,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:45:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:12,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:45:12,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:12,891 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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-02-07 22:45:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:13,008 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2025-02-07 22:45:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:45:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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 45 [2025-02-07 22:45:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:13,009 INFO L225 Difference]: With dead ends: 251 [2025-02-07 22:45:13,009 INFO L226 Difference]: Without dead ends: 169 [2025-02-07 22:45:13,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:45:13,010 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 298 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:13,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 380 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-07 22:45:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2025-02-07 22:45:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 149 states have internal predecessors, (206), 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-02-07 22:45:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2025-02-07 22:45:13,014 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 45 [2025-02-07 22:45:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:13,015 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2025-02-07 22:45:13,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 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-02-07 22:45:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2025-02-07 22:45:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 22:45:13,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:13,015 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] [2025-02-07 22:45:13,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:45:13,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash 937417023, now seen corresponding path program 1 times [2025-02-07 22:45:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:13,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716425737] [2025-02-07 22:45:13,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:13,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:13,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 22:45:13,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 22:45:13,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:13,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716425737] [2025-02-07 22:45:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716425737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546139934] [2025-02-07 22:45:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:13,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:13,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:13,197 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-02-07 22:45:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:13,245 INFO L93 Difference]: Finished difference Result 238 states and 326 transitions. [2025-02-07 22:45:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-02-07 22:45:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:13,247 INFO L225 Difference]: With dead ends: 238 [2025-02-07 22:45:13,247 INFO L226 Difference]: Without dead ends: 150 [2025-02-07 22:45:13,247 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-02-07 22:45:13,247 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 15 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:13,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 270 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-07 22:45:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-02-07 22:45:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 149 states have internal predecessors, (204), 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-02-07 22:45:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2025-02-07 22:45:13,251 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 46 [2025-02-07 22:45:13,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:13,251 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2025-02-07 22:45:13,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-02-07 22:45:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2025-02-07 22:45:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-07 22:45:13,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:13,252 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] [2025-02-07 22:45:13,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:45:13,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:13,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:13,253 INFO L85 PathProgramCache]: Analyzing trace with hash -54768781, now seen corresponding path program 1 times [2025-02-07 22:45:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148408519] [2025-02-07 22:45:13,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:13,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-07 22:45:13,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-07 22:45:13,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:13,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148408519] [2025-02-07 22:45:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148408519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:45:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445901782] [2025-02-07 22:45:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:13,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:13,395 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-02-07 22:45:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:13,512 INFO L93 Difference]: Finished difference Result 246 states and 333 transitions. [2025-02-07 22:45:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 47 [2025-02-07 22:45:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:13,513 INFO L225 Difference]: With dead ends: 246 [2025-02-07 22:45:13,513 INFO L226 Difference]: Without dead ends: 158 [2025-02-07 22:45:13,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-07 22:45:13,515 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 111 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:13,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 179 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-07 22:45:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-02-07 22:45:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3548387096774193) internal successors, (210), 155 states have internal predecessors, (210), 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-02-07 22:45:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2025-02-07 22:45:13,518 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 47 [2025-02-07 22:45:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2025-02-07 22:45:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-02-07 22:45:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2025-02-07 22:45:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 22:45:13,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:13,522 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] [2025-02-07 22:45:13,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:45:13,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:13,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash -575227417, now seen corresponding path program 1 times [2025-02-07 22:45:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037047030] [2025-02-07 22:45:13,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:13,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 22:45:13,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 22:45:13,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:13,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:13,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037047030] [2025-02-07 22:45:13,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037047030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057704607] [2025-02-07 22:45:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:13,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:45:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:13,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:45:13,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:45:13,703 INFO L87 Difference]: Start difference. First operand 156 states and 210 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-02-07 22:45:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:13,818 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2025-02-07 22:45:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:45:13,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2025-02-07 22:45:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:13,819 INFO L225 Difference]: With dead ends: 259 [2025-02-07 22:45:13,819 INFO L226 Difference]: Without dead ends: 164 [2025-02-07 22:45:13,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:45:13,820 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 101 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:13,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 181 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-07 22:45:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-02-07 22:45:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 161 states have internal predecessors, (216), 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-02-07 22:45:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2025-02-07 22:45:13,823 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 48 [2025-02-07 22:45:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:13,824 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2025-02-07 22:45:13,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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-02-07 22:45:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2025-02-07 22:45:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 22:45:13,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:13,824 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] [2025-02-07 22:45:13,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:45:13,824 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash -959527926, now seen corresponding path program 1 times [2025-02-07 22:45:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:13,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560412938] [2025-02-07 22:45:13,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:13,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 22:45:13,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 22:45:13,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:14,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560412938] [2025-02-07 22:45:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560412938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:14,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:14,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:45:14,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300454402] [2025-02-07 22:45:14,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:45:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:14,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:45:14,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:45:14,085 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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-02-07 22:45:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:14,243 INFO L93 Difference]: Finished difference Result 271 states and 360 transitions. [2025-02-07 22:45:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:45:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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 48 [2025-02-07 22:45:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:14,245 INFO L225 Difference]: With dead ends: 271 [2025-02-07 22:45:14,245 INFO L226 Difference]: Without dead ends: 183 [2025-02-07 22:45:14,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-07 22:45:14,245 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 295 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:14,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 553 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-07 22:45:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2025-02-07 22:45:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 164 states have internal predecessors, (220), 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-02-07 22:45:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2025-02-07 22:45:14,252 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 48 [2025-02-07 22:45:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2025-02-07 22:45:14,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 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-02-07 22:45:14,252 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2025-02-07 22:45:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 22:45:14,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:14,252 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] [2025-02-07 22:45:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:45:14,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -403567303, now seen corresponding path program 1 times [2025-02-07 22:45:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361165380] [2025-02-07 22:45:14,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 22:45:14,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 22:45:14,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:14,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361165380] [2025-02-07 22:45:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361165380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:45:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369667599] [2025-02-07 22:45:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:45:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:14,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:45:14,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:45:14,618 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) 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-02-07 22:45:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:14,799 INFO L93 Difference]: Finished difference Result 271 states and 359 transitions. [2025-02-07 22:45:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:45:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) 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 49 [2025-02-07 22:45:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:14,801 INFO L225 Difference]: With dead ends: 271 [2025-02-07 22:45:14,803 INFO L226 Difference]: Without dead ends: 183 [2025-02-07 22:45:14,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:45:14,804 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 290 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:14,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 539 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-07 22:45:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2025-02-07 22:45:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3392857142857142) internal successors, (225), 168 states have internal predecessors, (225), 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-02-07 22:45:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 225 transitions. [2025-02-07 22:45:14,810 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 225 transitions. Word has length 49 [2025-02-07 22:45:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 225 transitions. [2025-02-07 22:45:14,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) 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-02-07 22:45:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 225 transitions. [2025-02-07 22:45:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 22:45:14,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:14,810 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] [2025-02-07 22:45:14,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:45:14,810 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:14,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1353926999, now seen corresponding path program 1 times [2025-02-07 22:45:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:14,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062128232] [2025-02-07 22:45:14,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:14,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:14,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 22:45:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 22:45:14,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:14,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062128232] [2025-02-07 22:45:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062128232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:45:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937387459] [2025-02-07 22:45:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:45:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:15,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:45:15,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:45:15,131 INFO L87 Difference]: Start difference. First operand 169 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-02-07 22:45:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:15,445 INFO L93 Difference]: Finished difference Result 288 states and 381 transitions. [2025-02-07 22:45:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:45:15,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2025-02-07 22:45:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:15,447 INFO L225 Difference]: With dead ends: 288 [2025-02-07 22:45:15,447 INFO L226 Difference]: Without dead ends: 169 [2025-02-07 22:45:15,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:45:15,448 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 114 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:15,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 272 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:45:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-07 22:45:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2025-02-07 22:45:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3271604938271604) internal successors, (215), 162 states have internal predecessors, (215), 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-02-07 22:45:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 215 transitions. [2025-02-07 22:45:15,455 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 215 transitions. Word has length 50 [2025-02-07 22:45:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:15,455 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 215 transitions. [2025-02-07 22:45:15,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-02-07 22:45:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 215 transitions. [2025-02-07 22:45:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 22:45:15,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:15,456 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] [2025-02-07 22:45:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:45:15,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:15,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2105096769, now seen corresponding path program 1 times [2025-02-07 22:45:15,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867625465] [2025-02-07 22:45:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:15,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 22:45:15,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 22:45:15,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:15,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:15,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867625465] [2025-02-07 22:45:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867625465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:45:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763815597] [2025-02-07 22:45:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:15,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:15,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:15,550 INFO L87 Difference]: Start difference. First operand 163 states and 215 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-02-07 22:45:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:15,630 INFO L93 Difference]: Finished difference Result 295 states and 384 transitions. [2025-02-07 22:45:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2025-02-07 22:45:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:15,631 INFO L225 Difference]: With dead ends: 295 [2025-02-07 22:45:15,631 INFO L226 Difference]: Without dead ends: 157 [2025-02-07 22:45:15,632 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-02-07 22:45:15,632 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:15,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 252 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-07 22:45:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-07 22:45:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 156 states have internal predecessors, (207), 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-02-07 22:45:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 207 transitions. [2025-02-07 22:45:15,638 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 207 transitions. Word has length 50 [2025-02-07 22:45:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:15,638 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 207 transitions. [2025-02-07 22:45:15,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-02-07 22:45:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 207 transitions. [2025-02-07 22:45:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 22:45:15,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:15,639 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] [2025-02-07 22:45:15,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:45:15,639 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1297702379, now seen corresponding path program 1 times [2025-02-07 22:45:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365713180] [2025-02-07 22:45:15,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:15,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-07 22:45:15,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 22:45:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365713180] [2025-02-07 22:45:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365713180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:15,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:15,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:45:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414414557] [2025-02-07 22:45:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:15,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:45:15,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:15,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:45:15,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:15,791 INFO L87 Difference]: Start difference. First operand 157 states and 207 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-02-07 22:45:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:15,881 INFO L93 Difference]: Finished difference Result 256 states and 338 transitions. [2025-02-07 22:45:15,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:45:15,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 51 [2025-02-07 22:45:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:15,882 INFO L225 Difference]: With dead ends: 256 [2025-02-07 22:45:15,882 INFO L226 Difference]: Without dead ends: 165 [2025-02-07 22:45:15,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:15,882 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 16 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:15,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 423 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-07 22:45:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2025-02-07 22:45:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.31875) internal successors, (211), 160 states have internal predecessors, (211), 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-02-07 22:45:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2025-02-07 22:45:15,888 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 211 transitions. Word has length 51 [2025-02-07 22:45:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:15,888 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 211 transitions. [2025-02-07 22:45:15,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-02-07 22:45:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2025-02-07 22:45:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-07 22:45:15,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:15,889 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] [2025-02-07 22:45:15,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:45:15,889 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:15,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -352461668, now seen corresponding path program 1 times [2025-02-07 22:45:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389542500] [2025-02-07 22:45:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:15,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 22:45:15,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 22:45:15,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:15,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389542500] [2025-02-07 22:45:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389542500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:45:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778284000] [2025-02-07 22:45:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:45:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:45:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:16,050 INFO L87 Difference]: Start difference. First operand 161 states and 211 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-02-07 22:45:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:16,138 INFO L93 Difference]: Finished difference Result 258 states and 338 transitions. [2025-02-07 22:45:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:45:16,139 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 52 [2025-02-07 22:45:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:16,139 INFO L225 Difference]: With dead ends: 258 [2025-02-07 22:45:16,139 INFO L226 Difference]: Without dead ends: 165 [2025-02-07 22:45:16,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:45:16,140 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 96 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:16,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 411 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 22:45:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-07 22:45:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-02-07 22:45:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 162 states have internal predecessors, (213), 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-02-07 22:45:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2025-02-07 22:45:16,148 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 52 [2025-02-07 22:45:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:16,148 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2025-02-07 22:45:16,148 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-02-07 22:45:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2025-02-07 22:45:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-07 22:45:16,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:16,148 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] [2025-02-07 22:45:16,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:45:16,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:16,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:16,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2056509697, now seen corresponding path program 1 times [2025-02-07 22:45:16,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:16,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551021646] [2025-02-07 22:45:16,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:16,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 22:45:16,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 22:45:16,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:16,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:45:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551021646] [2025-02-07 22:45:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551021646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:16,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:45:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099705963] [2025-02-07 22:45:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:16,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:45:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:45:16,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:45:16,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:45:16,463 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 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-02-07 22:45:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:16,686 INFO L93 Difference]: Finished difference Result 257 states and 335 transitions. [2025-02-07 22:45:16,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:45:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 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 52 [2025-02-07 22:45:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:16,687 INFO L225 Difference]: With dead ends: 257 [2025-02-07 22:45:16,687 INFO L226 Difference]: Without dead ends: 163 [2025-02-07 22:45:16,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:45:16,688 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 95 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:16,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 235 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:45:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-07 22:45:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-07 22:45:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 162 states have internal predecessors, (211), 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-02-07 22:45:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2025-02-07 22:45:16,695 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 52 [2025-02-07 22:45:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:16,695 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2025-02-07 22:45:16,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 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-02-07 22:45:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2025-02-07 22:45:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-07 22:45:16,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:16,695 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] [2025-02-07 22:45:16,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:45:16,696 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:16,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:16,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1539039768, now seen corresponding path program 1 times [2025-02-07 22:45:16,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:45:16,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393629565] [2025-02-07 22:45:16,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:45:16,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-07 22:45:16,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-07 22:45:16,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:16,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:45:16,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 22:45:16,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-07 22:45:16,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-07 22:45:16,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:16,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 22:45:16,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 22:45:16,796 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 22:45:16,797 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 22:45:16,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:45:16,801 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] [2025-02-07 22:45:16,830 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 22:45:16,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 22:45:16,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 10:45:16 BoogieIcfgContainer [2025-02-07 22:45:16,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 22:45:16,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 22:45:16,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 22:45:16,843 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 22:45:16,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:10" (3/4) ... [2025-02-07 22:45:16,845 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 22:45:16,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 22:45:16,846 INFO L158 Benchmark]: Toolchain (without parser) took 7648.52ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 158.5MB in the beginning and 271.4MB in the end (delta: -112.9MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2025-02-07 22:45:16,846 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:16,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.79ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 142.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 22:45:16,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.05ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 134.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 22:45:16,846 INFO L158 Benchmark]: Boogie Preprocessor took 71.06ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 129.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:16,846 INFO L158 Benchmark]: IcfgBuilder took 529.12ms. Allocated memory is still 201.3MB. Free memory was 129.7MB in the beginning and 79.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 22:45:16,847 INFO L158 Benchmark]: TraceAbstraction took 6729.53ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 79.0MB in the beginning and 271.5MB in the end (delta: -192.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:16,847 INFO L158 Benchmark]: Witness Printer took 2.35ms. Allocated memory is still 369.1MB. Free memory was 271.5MB in the beginning and 271.4MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 22:45:16,848 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.20ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.79ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 142.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.05ms. Allocated memory is still 201.3MB. Free memory was 142.6MB in the beginning and 134.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.06ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 129.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 529.12ms. Allocated memory is still 201.3MB. Free memory was 129.7MB in the beginning and 79.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6729.53ms. Allocated memory was 201.3MB in the beginning and 369.1MB in the end (delta: 167.8MB). Free memory was 79.0MB in the beginning and 271.5MB in the end (delta: -192.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.35ms. Allocated memory is still 369.1MB. Free memory was 271.5MB in the beginning and 271.4MB in the end (delta: 60.1kB). There was no memory consumed. 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 bitwiseOr at line 123, overapproximation of bitwiseAnd at line 115, overapproximation of bitwiseAnd at line 94, overapproximation of bitwiseAnd at line 111, overapproximation of bitwiseAnd at line 128, overapproximation of bitwiseAnd at line 98. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 2); [L33] const SORT_27 msb_SORT_27 = (SORT_27)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_24 = 1; [L39] const SORT_1 var_41 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L53] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_31_arg_1 = var_15; [L62] state_30 = init_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_41=1] [L83] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_21=2, var_24=1, var_41=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_25_arg_0 = var_20; [L85] SORT_5 var_25_arg_1 = var_24; [L86] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L87] SORT_1 var_26_arg_0 = var_25; [L88] SORT_1 var_26 = ~var_26_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_23_arg_0 = var_22; [L93] SORT_1 var_23 = ~var_23_arg_0; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_23=-1, var_24=1, var_26=-1, var_41=1] [L94] EXPR var_23 & mask_SORT_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 var_28_arg_0 = var_26; [L96] SORT_1 var_28_arg_1 = var_23; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_28_arg_0=-1, var_28_arg_1=0, var_41=1] [L97] EXPR ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L97] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1; [L98] EXPR var_28 & mask_SORT_27 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L98] var_28 = var_28 & mask_SORT_27 [L99] SORT_27 var_29_arg_0 = var_28; [L100] SORT_1 var_29 = var_29_arg_0 == mask_SORT_27; [L101] SORT_1 var_32_arg_0 = state_18; [L102] SORT_5 var_32_arg_1 = state_30; [L103] SORT_5 var_32_arg_2 = input_7; [L104] SORT_5 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_32=0, var_41=1] [L105] EXPR var_32 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_41=1] [L105] var_32 = var_32 & mask_SORT_5 [L106] SORT_5 var_33_arg_0 = var_32; [L107] SORT_5 var_33_arg_1 = var_21; [L108] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_1 var_34 = ~var_34_arg_0; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_32=0, var_34=-1, var_41=1] [L111] EXPR var_34 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=1, var_32=0, var_41=1] [L111] var_34 = var_34 & mask_SORT_1 [L112] SORT_1 var_35_arg_0 = var_26; [L113] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=1, var_32=0, var_35_arg_0=-1, var_35_arg_1=0, var_41=1] [L114] EXPR ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=1, var_32=0, var_41=1] [L114] SORT_27 var_35 = ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1; [L115] EXPR var_35 & mask_SORT_27 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=1, var_32=0, var_41=1] [L115] var_35 = var_35 & mask_SORT_27 [L116] SORT_27 var_36_arg_0 = var_35; [L117] SORT_1 var_36 = var_36_arg_0 == mask_SORT_27; [L118] SORT_1 var_37_arg_0 = var_29; [L119] SORT_1 var_37_arg_1 = var_36; [L120] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L121] SORT_1 var_38_arg_0 = var_14; [L122] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_38_arg_0=-1, var_38_arg_1=1, var_41=1] [L123] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L123] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L124] SORT_1 var_42_arg_0 = var_38; [L125] SORT_1 var_42 = ~var_42_arg_0; [L126] SORT_1 var_43_arg_0 = var_41; [L127] SORT_1 var_43_arg_1 = var_42; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1, var_43_arg_0=1, var_43_arg_1=-1] [L128] EXPR var_43_arg_0 & var_43_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L128] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L129] EXPR var_43 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L129] var_43 = var_43 & mask_SORT_1 [L130] SORT_1 bad_44_arg_0 = var_43; [L131] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1834 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1834 mSDsluCounter, 5621 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4120 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2888 IncrementalHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 1501 mSDtfsCounter, 2888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=13, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 69 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 878 NumberOfCodeBlocks, 878 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 3559 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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-02-07 22:45:16,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:45:18,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:45:19,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 22:45:19,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:45:19,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:45:19,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:45:19,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:45:19,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:45:19,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:45:19,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:45:19,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:45:19,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:45:19,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:45:19,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:45:19,077 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:45:19,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 22:45:19,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:45:19,079 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:45:19,079 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:45:19,079 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:45:19,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:45:19,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:45:19,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:45:19,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:19,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:45:19,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:45:19,080 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-jdk21/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 -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2025-02-07 22:45:19,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:45:19,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:45:19,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:45:19,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:45:19,346 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:45:19,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-02-07 22:45:20,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b3c41389/fc97018bf50941f78569471aa73756e5/FLAG8c28555eb [2025-02-07 22:45:20,866 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:45:20,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2025-02-07 22:45:20,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b3c41389/fc97018bf50941f78569471aa73756e5/FLAG8c28555eb [2025-02-07 22:45:20,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b3c41389/fc97018bf50941f78569471aa73756e5 [2025-02-07 22:45:20,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:45:20,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:45:20,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:20,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:45:20,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:45:20,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:20" (1/1) ... [2025-02-07 22:45:20,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53029bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:20, skipping insertion in model container [2025-02-07 22:45:20,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:45:20" (1/1) ... [2025-02-07 22:45:20,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:45:21,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2025-02-07 22:45:21,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:21,080 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:45:21,089 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2025-02-07 22:45:21,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:45:21,137 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:45:21,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21 WrapperNode [2025-02-07 22:45:21,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:45:21,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:21,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:45:21,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:45:21,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,171 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 209 [2025-02-07 22:45:21,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:45:21,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:45:21,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:45:21,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:45:21,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,202 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-02-07 22:45:21,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:45:21,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:45:21,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:45:21,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:45:21,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (1/1) ... [2025-02-07 22:45:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:45:21,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:21,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:45:21,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:45:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:45:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 22:45:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 22:45:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:45:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:45:21,338 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:45:21,339 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:45:21,493 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-02-07 22:45:21,493 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:45:21,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:45:21,499 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:45:21,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:21 BoogieIcfgContainer [2025-02-07 22:45:21,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:45:21,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:45:21,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:45:21,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:45:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:45:20" (1/3) ... [2025-02-07 22:45:21,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:21, skipping insertion in model container [2025-02-07 22:45:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:45:21" (2/3) ... [2025-02-07 22:45:21,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6955e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:45:21, skipping insertion in model container [2025-02-07 22:45:21,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:45:21" (3/3) ... [2025-02-07 22:45:21,507 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2025-02-07 22:45:21,516 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:45:21,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal51.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:45:21,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:45:21,551 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;@74e57073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:45:21,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:45:21,554 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-02-07 22:45:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 22:45:21,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:21,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 22:45:21,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:21,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 22:45:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:45:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84613671] [2025-02-07 22:45:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:21,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:21,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:21,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:45:21,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:45:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 22:45:21,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 22:45:21,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:21,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:21,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 22:45:21,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:45:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:21,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:45:21,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:45:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84613671] [2025-02-07 22:45:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84613671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:45:21,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:45:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 22:45:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052363727] [2025-02-07 22:45:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:45:21,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:45:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:45:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:45:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:45:21,800 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-02-07 22:45:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:21,830 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 22:45:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:45:21,832 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-02-07 22:45:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:21,835 INFO L225 Difference]: With dead ends: 16 [2025-02-07 22:45:21,835 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 22:45:21,837 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-02-07 22:45:21,838 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-02-07 22:45:21,839 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-02-07 22:45:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 22:45:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 22:45:21,852 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-02-07 22:45:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 22:45:21,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 22:45:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:21,855 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 22:45:21,855 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-02-07 22:45:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 22:45:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 22:45:21,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:21,855 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 22:45:21,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:45:22,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:22,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:22,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 22:45:22,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:45:22,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [351238593] [2025-02-07 22:45:22,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:45:22,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:22,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:22,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:45:22,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 22:45:22,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 22:45:22,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 22:45:22,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:45:22,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:22,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-07 22:45:22,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:45:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:22,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:45:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:25,995 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 22:45:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351238593] [2025-02-07 22:45:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351238593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 22:45:25,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 22:45:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 22:45:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835238336] [2025-02-07 22:45:25,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 22:45:25,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:45:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 22:45:25,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:45:25,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:45:25,997 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-02-07 22:45:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:45:26,076 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 22:45:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:45:26,077 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-02-07 22:45:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:45:26,077 INFO L225 Difference]: With dead ends: 13 [2025-02-07 22:45:26,077 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 22:45:26,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:45:26,077 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:45:26,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 22:45:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 22:45:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 22:45:26,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-02-07 22:45:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 22:45:26,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 22:45:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:45:26,080 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 22:45:26,080 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-02-07 22:45:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 22:45:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 22:45:26,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:45:26,080 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 22:45:26,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 22:45:26,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:26,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:45:26,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:45:26,286 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 22:45:26,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 22:45:26,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087690541] [2025-02-07 22:45:26,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 22:45:26,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:45:26,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:45:26,290 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:45:26,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 22:45:26,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 22:45:26,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 22:45:26,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 22:45:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:45:26,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-07 22:45:26,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:45:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 22:45:27,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 22:46:30,498 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 585 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)