./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:20:36,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:20:36,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:20:36,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:20:36,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:20:36,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:20:36,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:20:36,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:20:36,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:20:36,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:20:36,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:20:36,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:20:36,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:20:36,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:20:36,430 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:20:36,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:20:36,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:20:36,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:20:36,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:20:36,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:20:36,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:20:36,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:20:36,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:20:36,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:20:36,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:20:36,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:20:36,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:20:36,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:20:36,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:20:36,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:20:36,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:20:36,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:20:36,434 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f29c97960939e53f55e46ebed0dba8de02c44a30d845c26a8268aafa8af6f244 [2025-01-09 04:20:36,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:20:36,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:20:36,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:20:36,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:20:36,637 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:20:36,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2025-01-09 04:20:37,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0d59bec2/a2d9ef6090b4465f844fa43beadcece0/FLAGd26529677 [2025-01-09 04:20:38,064 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:20:38,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2025-01-09 04:20:38,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0d59bec2/a2d9ef6090b4465f844fa43beadcece0/FLAGd26529677 [2025-01-09 04:20:38,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0d59bec2/a2d9ef6090b4465f844fa43beadcece0 [2025-01-09 04:20:38,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:20:38,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:20:38,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:20:38,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:20:38,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:20:38,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30296b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38, skipping insertion in model container [2025-01-09 04:20:38,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:20:38,292 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/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2025-01-09 04:20:38,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:20:38,315 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:20:38,377 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/seq-mthreaded/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c[12968,12981] [2025-01-09 04:20:38,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:20:38,397 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:20:38,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38 WrapperNode [2025-01-09 04:20:38,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:20:38,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:20:38,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:20:38,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:20:38,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,446 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 451 [2025-01-09 04:20:38,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:20:38,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:20:38,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:20:38,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:20:38,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,462 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:20:38,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:20:38,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:20:38,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:20:38,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:20:38,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (1/1) ... [2025-01-09 04:20:38,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:20:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:20:38,544 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-01-09 04:20:38,546 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-01-09 04:20:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:20:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:20:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:20:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:20:38,635 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:20:38,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:20:39,103 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 04:20:39,103 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:20:39,115 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:20:39,115 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:20:39,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:39 BoogieIcfgContainer [2025-01-09 04:20:39,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:20:39,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:20:39,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:20:39,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:20:39,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:20:38" (1/3) ... [2025-01-09 04:20:39,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e67e2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:39, skipping insertion in model container [2025-01-09 04:20:39,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:38" (2/3) ... [2025-01-09 04:20:39,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e67e2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:39, skipping insertion in model container [2025-01-09 04:20:39,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:39" (3/3) ... [2025-01-09 04:20:39,124 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c [2025-01-09 04:20:39,135 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:20:39,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c that has 1 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:20:39,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:20:39,200 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;@57d8b2e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:20:39,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:20:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 123 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-01-09 04:20:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:20:39,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:39,213 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] [2025-01-09 04:20:39,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:39,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash -499913509, now seen corresponding path program 1 times [2025-01-09 04:20:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:39,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516458736] [2025-01-09 04:20:39,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:39,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:20:39,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:20:39,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:39,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:39,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:39,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516458736] [2025-01-09 04:20:39,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516458736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:39,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:39,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:20:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496246644] [2025-01-09 04:20:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:39,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:20:39,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:39,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:20:39,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:20:39,488 INFO L87 Difference]: Start difference. First operand has 124 states, 122 states have (on average 1.7704918032786885) internal successors, (216), 123 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) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:39,503 INFO L93 Difference]: Finished difference Result 189 states and 328 transitions. [2025-01-09 04:20:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:20:39,504 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 04:20:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:39,509 INFO L225 Difference]: With dead ends: 189 [2025-01-09 04:20:39,509 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 04:20:39,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:20:39,513 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:39,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 04:20:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 04:20:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.7583333333333333) internal successors, (211), 120 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-01-09 04:20:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 211 transitions. [2025-01-09 04:20:39,536 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 211 transitions. Word has length 37 [2025-01-09 04:20:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:39,536 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 211 transitions. [2025-01-09 04:20:39,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 211 transitions. [2025-01-09 04:20:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:20:39,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:39,537 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] [2025-01-09 04:20:39,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:20:39,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1317561959, now seen corresponding path program 1 times [2025-01-09 04:20:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733631777] [2025-01-09 04:20:39,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:39,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:20:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:20:39,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:39,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:39,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-01-09 04:20:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:39,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733631777] [2025-01-09 04:20:39,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733631777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:39,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:39,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:20:39,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135507116] [2025-01-09 04:20:39,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:39,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:20:39,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:39,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:20:39,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:39,790 INFO L87 Difference]: Start difference. First operand 121 states and 211 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:39,865 INFO L93 Difference]: Finished difference Result 189 states and 324 transitions. [2025-01-09 04:20:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:39,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 04:20:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:39,868 INFO L225 Difference]: With dead ends: 189 [2025-01-09 04:20:39,868 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 04:20:39,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:39,869 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:39,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 04:20:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-01-09 04:20:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 120 states have internal predecessors, (184), 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-01-09 04:20:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2025-01-09 04:20:39,874 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 37 [2025-01-09 04:20:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:39,875 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2025-01-09 04:20:39,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2025-01-09 04:20:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:20:39,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:39,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:39,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:20:39,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:39,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1506342942, now seen corresponding path program 1 times [2025-01-09 04:20:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762225131] [2025-01-09 04:20:39,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:39,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:20:39,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:20:39,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:39,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:39,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762225131] [2025-01-09 04:20:39,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762225131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362739845] [2025-01-09 04:20:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:39,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:39,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:39,984 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-09 04:20:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:40,042 INFO L93 Difference]: Finished difference Result 238 states and 381 transitions. [2025-01-09 04:20:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2025-01-09 04:20:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:40,045 INFO L225 Difference]: With dead ends: 238 [2025-01-09 04:20:40,045 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 04:20:40,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:40,046 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 83 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:40,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 316 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 04:20:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-01-09 04:20:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.5529411764705883) internal successors, (264), 170 states have internal predecessors, (264), 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-01-09 04:20:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 264 transitions. [2025-01-09 04:20:40,056 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 264 transitions. Word has length 63 [2025-01-09 04:20:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:40,057 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 264 transitions. [2025-01-09 04:20:40,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-01-09 04:20:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 264 transitions. [2025-01-09 04:20:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:20:40,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:40,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:20:40,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash 599403210, now seen corresponding path program 1 times [2025-01-09 04:20:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:40,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-01-09 04:20:40,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:40,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:20:40,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:20:40,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:40,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011782866] [2025-01-09 04:20:40,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011782866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:40,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:40,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:40,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712801139] [2025-01-09 04:20:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:40,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:40,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:40,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:40,201 INFO L87 Difference]: Start difference. First operand 171 states and 264 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-01-09 04:20:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:40,227 INFO L93 Difference]: Finished difference Result 385 states and 616 transitions. [2025-01-09 04:20:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2025-01-09 04:20:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:40,230 INFO L225 Difference]: With dead ends: 385 [2025-01-09 04:20:40,231 INFO L226 Difference]: Without dead ends: 271 [2025-01-09 04:20:40,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:40,232 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:40,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 332 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-01-09 04:20:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2025-01-09 04:20:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.5789473684210527) internal successors, (420), 266 states have internal predecessors, (420), 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-01-09 04:20:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 420 transitions. [2025-01-09 04:20:40,249 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 420 transitions. Word has length 65 [2025-01-09 04:20:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:40,249 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 420 transitions. [2025-01-09 04:20:40,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-01-09 04:20:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 420 transitions. [2025-01-09 04:20:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:20:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:40,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:40,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:20:40,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:40,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2021263406, now seen corresponding path program 1 times [2025-01-09 04:20:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006088574] [2025-01-09 04:20:40,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:40,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:20:40,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:20:40,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:40,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006088574] [2025-01-09 04:20:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006088574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:40,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432954225] [2025-01-09 04:20:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:40,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:40,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:40,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:40,365 INFO L87 Difference]: Start difference. First operand 267 states and 420 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-09 04:20:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:40,394 INFO L93 Difference]: Finished difference Result 659 states and 1058 transitions. [2025-01-09 04:20:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:40,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-01-09 04:20:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:40,397 INFO L225 Difference]: With dead ends: 659 [2025-01-09 04:20:40,398 INFO L226 Difference]: Without dead ends: 449 [2025-01-09 04:20:40,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:40,399 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 79 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:40,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 333 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-09 04:20:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 443. [2025-01-09 04:20:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.583710407239819) internal successors, (700), 442 states have internal predecessors, (700), 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-01-09 04:20:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 700 transitions. [2025-01-09 04:20:40,411 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 700 transitions. Word has length 67 [2025-01-09 04:20:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:40,411 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 700 transitions. [2025-01-09 04:20:40,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-09 04:20:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 700 transitions. [2025-01-09 04:20:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:20:40,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:40,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:40,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:20:40,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:40,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:40,413 INFO L85 PathProgramCache]: Analyzing trace with hash 987723514, now seen corresponding path program 1 times [2025-01-09 04:20:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563012216] [2025-01-09 04:20:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:40,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:20:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:20:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563012216] [2025-01-09 04:20:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563012216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:40,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:20:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162852570] [2025-01-09 04:20:40,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:40,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:20:40,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:40,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:20:40,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:40,534 INFO L87 Difference]: Start difference. First operand 443 states and 700 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:40,688 INFO L93 Difference]: Finished difference Result 2199 states and 3570 transitions. [2025-01-09 04:20:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:20:40,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:20:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:40,696 INFO L225 Difference]: With dead ends: 2199 [2025-01-09 04:20:40,697 INFO L226 Difference]: Without dead ends: 1813 [2025-01-09 04:20:40,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:20:40,700 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 699 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:40,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1149 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-01-09 04:20:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 811. [2025-01-09 04:20:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.5950617283950617) internal successors, (1292), 810 states have internal predecessors, (1292), 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-01-09 04:20:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1292 transitions. [2025-01-09 04:20:40,735 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1292 transitions. Word has length 69 [2025-01-09 04:20:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:40,735 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1292 transitions. [2025-01-09 04:20:40,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1292 transitions. [2025-01-09 04:20:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:20:40,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:40,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:20:40,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1368174809, now seen corresponding path program 1 times [2025-01-09 04:20:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622351783] [2025-01-09 04:20:40,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:40,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:20:40,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:20:40,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:40,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:40,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622351783] [2025-01-09 04:20:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622351783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:40,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:20:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977308892] [2025-01-09 04:20:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:40,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:40,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:40,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:40,850 INFO L87 Difference]: Start difference. First operand 811 states and 1292 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:40,936 INFO L93 Difference]: Finished difference Result 2921 states and 4705 transitions. [2025-01-09 04:20:40,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:20:40,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:20:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:40,945 INFO L225 Difference]: With dead ends: 2921 [2025-01-09 04:20:40,945 INFO L226 Difference]: Without dead ends: 2167 [2025-01-09 04:20:40,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 04:20:40,948 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 309 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:40,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 595 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2025-01-09 04:20:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 1480. [2025-01-09 04:20:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 1.5963488843813387) internal successors, (2361), 1479 states have internal predecessors, (2361), 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-01-09 04:20:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2361 transitions. [2025-01-09 04:20:40,991 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2361 transitions. Word has length 70 [2025-01-09 04:20:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:40,992 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2361 transitions. [2025-01-09 04:20:40,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2361 transitions. [2025-01-09 04:20:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:20:40,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:40,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:40,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:20:40,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:40,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1217574447, now seen corresponding path program 1 times [2025-01-09 04:20:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999619090] [2025-01-09 04:20:40,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:41,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:20:41,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:20:41,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:41,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999619090] [2025-01-09 04:20:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999619090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:41,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:41,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:20:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56485034] [2025-01-09 04:20:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:41,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:41,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:41,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:41,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:41,119 INFO L87 Difference]: Start difference. First operand 1480 states and 2361 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-09 04:20:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:41,208 INFO L93 Difference]: Finished difference Result 4349 states and 7011 transitions. [2025-01-09 04:20:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:20:41,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2025-01-09 04:20:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:41,218 INFO L225 Difference]: With dead ends: 4349 [2025-01-09 04:20:41,219 INFO L226 Difference]: Without dead ends: 2926 [2025-01-09 04:20:41,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 04:20:41,222 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 309 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:41,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 587 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2025-01-09 04:20:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2187. [2025-01-09 04:20:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2186 states have (on average 1.5946935041171089) internal successors, (3486), 2186 states have internal predecessors, (3486), 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-01-09 04:20:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3486 transitions. [2025-01-09 04:20:41,287 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3486 transitions. Word has length 71 [2025-01-09 04:20:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:41,287 INFO L471 AbstractCegarLoop]: Abstraction has 2187 states and 3486 transitions. [2025-01-09 04:20:41,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-01-09 04:20:41,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3486 transitions. [2025-01-09 04:20:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:20:41,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:41,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:41,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:20:41,290 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:41,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash 35170170, now seen corresponding path program 1 times [2025-01-09 04:20:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:41,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661385550] [2025-01-09 04:20:41,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:41,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:41,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:20:41,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:20:41,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:41,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661385550] [2025-01-09 04:20:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661385550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856900250] [2025-01-09 04:20:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:41,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:41,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:41,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:41,357 INFO L87 Difference]: Start difference. First operand 2187 states and 3486 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:41,410 INFO L93 Difference]: Finished difference Result 5256 states and 8437 transitions. [2025-01-09 04:20:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:20:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:41,424 INFO L225 Difference]: With dead ends: 5256 [2025-01-09 04:20:41,424 INFO L226 Difference]: Without dead ends: 3126 [2025-01-09 04:20:41,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:41,429 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 90 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:41,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 422 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2025-01-09 04:20:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3124. [2025-01-09 04:20:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.6016650656420108) internal successors, (5002), 3123 states have internal predecessors, (5002), 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-01-09 04:20:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 5002 transitions. [2025-01-09 04:20:41,514 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 5002 transitions. Word has length 72 [2025-01-09 04:20:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:41,514 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 5002 transitions. [2025-01-09 04:20:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5002 transitions. [2025-01-09 04:20:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:20:41,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:41,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:20:41,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:41,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash -674926178, now seen corresponding path program 1 times [2025-01-09 04:20:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532935847] [2025-01-09 04:20:41,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:41,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:20:41,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:20:41,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:41,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:41,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532935847] [2025-01-09 04:20:41,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532935847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:41,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:41,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:20:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858669413] [2025-01-09 04:20:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:41,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:20:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:41,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:20:41,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:20:41,612 INFO L87 Difference]: Start difference. First operand 3124 states and 5002 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:41,735 INFO L93 Difference]: Finished difference Result 9211 states and 14869 transitions. [2025-01-09 04:20:41,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:20:41,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:20:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:41,753 INFO L225 Difference]: With dead ends: 9211 [2025-01-09 04:20:41,754 INFO L226 Difference]: Without dead ends: 6146 [2025-01-09 04:20:41,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-09 04:20:41,760 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 307 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:41,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 625 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2025-01-09 04:20:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 4603. [2025-01-09 04:20:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 4602 states have (on average 1.5975662755323772) internal successors, (7352), 4602 states have internal predecessors, (7352), 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-01-09 04:20:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 7352 transitions. [2025-01-09 04:20:41,888 INFO L78 Accepts]: Start accepts. Automaton has 4603 states and 7352 transitions. Word has length 72 [2025-01-09 04:20:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:41,888 INFO L471 AbstractCegarLoop]: Abstraction has 4603 states and 7352 transitions. [2025-01-09 04:20:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4603 states and 7352 transitions. [2025-01-09 04:20:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:20:41,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:41,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:41,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:20:41,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2138099108, now seen corresponding path program 1 times [2025-01-09 04:20:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248986283] [2025-01-09 04:20:41,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:41,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:20:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:20:41,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:41,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:41,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248986283] [2025-01-09 04:20:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248986283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:41,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927844158] [2025-01-09 04:20:41,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:41,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:41,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:41,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:41,950 INFO L87 Difference]: Start difference. First operand 4603 states and 7352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:42,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:42,046 INFO L93 Difference]: Finished difference Result 10358 states and 16572 transitions. [2025-01-09 04:20:42,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:42,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:20:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:42,075 INFO L225 Difference]: With dead ends: 10358 [2025-01-09 04:20:42,078 INFO L226 Difference]: Without dead ends: 7079 [2025-01-09 04:20:42,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:42,084 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 78 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:42,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2025-01-09 04:20:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7077. [2025-01-09 04:20:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 7076 states have (on average 1.5802713397399661) internal successors, (11182), 7076 states have internal predecessors, (11182), 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-01-09 04:20:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 11182 transitions. [2025-01-09 04:20:42,248 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 11182 transitions. Word has length 72 [2025-01-09 04:20:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:42,248 INFO L471 AbstractCegarLoop]: Abstraction has 7077 states and 11182 transitions. [2025-01-09 04:20:42,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 11182 transitions. [2025-01-09 04:20:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:20:42,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:42,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:42,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:20:42,249 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:42,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash 818494603, now seen corresponding path program 1 times [2025-01-09 04:20:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-01-09 04:20:42,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:42,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:20:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:20:42,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-01-09 04:20:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63283295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:42,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595634739] [2025-01-09 04:20:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:42,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:42,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:42,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:42,301 INFO L87 Difference]: Start difference. First operand 7077 states and 11182 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:42,441 INFO L93 Difference]: Finished difference Result 15783 states and 24973 transitions. [2025-01-09 04:20:42,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:42,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:20:42,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:42,491 INFO L225 Difference]: With dead ends: 15783 [2025-01-09 04:20:42,491 INFO L226 Difference]: Without dead ends: 10717 [2025-01-09 04:20:42,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:42,496 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 84 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:42,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 423 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:42,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2025-01-09 04:20:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 10715. [2025-01-09 04:20:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.5602016053761434) internal successors, (16716), 10714 states have internal predecessors, (16716), 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-01-09 04:20:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 16716 transitions. [2025-01-09 04:20:42,788 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 16716 transitions. Word has length 72 [2025-01-09 04:20:42,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:42,789 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 16716 transitions. [2025-01-09 04:20:42,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:20:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 16716 transitions. [2025-01-09 04:20:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:20:42,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:42,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:42,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:20:42,790 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:42,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:42,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2103449558, now seen corresponding path program 1 times [2025-01-09 04:20:42,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:42,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507028601] [2025-01-09 04:20:42,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:42,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:20:42,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:20:42,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:42,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507028601] [2025-01-09 04:20:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507028601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:20:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549091036] [2025-01-09 04:20:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:20:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:43,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:20:43,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:43,020 INFO L87 Difference]: Start difference. First operand 10715 states and 16716 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-09 04:20:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:43,244 INFO L93 Difference]: Finished difference Result 21361 states and 33340 transitions. [2025-01-09 04:20:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2025-01-09 04:20:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:43,270 INFO L225 Difference]: With dead ends: 21361 [2025-01-09 04:20:43,270 INFO L226 Difference]: Without dead ends: 10717 [2025-01-09 04:20:43,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:20:43,285 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 238 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:43,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 490 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2025-01-09 04:20:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 10715. [2025-01-09 04:20:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.5462012320328542) internal successors, (16566), 10714 states have internal predecessors, (16566), 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-01-09 04:20:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 16566 transitions. [2025-01-09 04:20:43,571 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 16566 transitions. Word has length 74 [2025-01-09 04:20:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 16566 transitions. [2025-01-09 04:20:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-09 04:20:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 16566 transitions. [2025-01-09 04:20:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:20:43,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:43,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:20:43,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1995849652, now seen corresponding path program 1 times [2025-01-09 04:20:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-01-09 04:20:43,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:43,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:20:43,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:20:43,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:43,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:43,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-01-09 04:20:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348537758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:43,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:20:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186441246] [2025-01-09 04:20:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:43,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:20:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:43,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:20:43,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:43,727 INFO L87 Difference]: Start difference. First operand 10715 states and 16566 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-01-09 04:20:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:44,000 INFO L93 Difference]: Finished difference Result 30918 states and 47950 transitions. [2025-01-09 04:20:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2025-01-09 04:20:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:44,038 INFO L225 Difference]: With dead ends: 30918 [2025-01-09 04:20:44,038 INFO L226 Difference]: Without dead ends: 20274 [2025-01-09 04:20:44,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:20:44,052 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 155 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:44,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 492 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20274 states. [2025-01-09 04:20:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20274 to 20272. [2025-01-09 04:20:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20272 states, 20271 states have (on average 1.5323368358739085) internal successors, (31062), 20271 states have internal predecessors, (31062), 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-01-09 04:20:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20272 states to 20272 states and 31062 transitions. [2025-01-09 04:20:44,541 INFO L78 Accepts]: Start accepts. Automaton has 20272 states and 31062 transitions. Word has length 77 [2025-01-09 04:20:44,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:44,541 INFO L471 AbstractCegarLoop]: Abstraction has 20272 states and 31062 transitions. [2025-01-09 04:20:44,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-01-09 04:20:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20272 states and 31062 transitions. [2025-01-09 04:20:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:20:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:44,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:20:44,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:20:44,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1313221375, now seen corresponding path program 1 times [2025-01-09 04:20:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120806674] [2025-01-09 04:20:44,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:20:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:20:44,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:44,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120806674] [2025-01-09 04:20:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120806674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:44,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:44,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:20:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49635850] [2025-01-09 04:20:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:44,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:20:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:44,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:20:44,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:44,754 INFO L87 Difference]: Start difference. First operand 20272 states and 31062 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-01-09 04:20:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:45,037 INFO L93 Difference]: Finished difference Result 21435 states and 32611 transitions. [2025-01-09 04:20:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:20:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2025-01-09 04:20:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:45,078 INFO L225 Difference]: With dead ends: 21435 [2025-01-09 04:20:45,078 INFO L226 Difference]: Without dead ends: 21433 [2025-01-09 04:20:45,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:20:45,088 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:45,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 710 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:20:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21433 states. [2025-01-09 04:20:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21433 to 21433. [2025-01-09 04:20:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21433 states, 21432 states have (on average 1.5030795072788354) internal successors, (32214), 21432 states have internal predecessors, (32214), 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-01-09 04:20:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21433 states to 21433 states and 32214 transitions. [2025-01-09 04:20:45,588 INFO L78 Accepts]: Start accepts. Automaton has 21433 states and 32214 transitions. Word has length 78 [2025-01-09 04:20:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:45,588 INFO L471 AbstractCegarLoop]: Abstraction has 21433 states and 32214 transitions. [2025-01-09 04:20:45,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-01-09 04:20:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21433 states and 32214 transitions. [2025-01-09 04:20:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:20:45,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:45,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:20:45,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:20:45,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:45,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:45,591 INFO L85 PathProgramCache]: Analyzing trace with hash 851127770, now seen corresponding path program 1 times [2025-01-09 04:20:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633966026] [2025-01-09 04:20:45,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:45,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:20:45,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:20:45,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:45,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:45,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633966026] [2025-01-09 04:20:45,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633966026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:45,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:45,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:45,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219579366] [2025-01-09 04:20:45,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:45,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:45,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:45,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:45,676 INFO L87 Difference]: Start difference. First operand 21433 states and 32214 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-09 04:20:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:46,095 INFO L93 Difference]: Finished difference Result 64038 states and 96172 transitions. [2025-01-09 04:20:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:46,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2025-01-09 04:20:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:46,183 INFO L225 Difference]: With dead ends: 64038 [2025-01-09 04:20:46,184 INFO L226 Difference]: Without dead ends: 42672 [2025-01-09 04:20:46,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:46,216 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 118 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:46,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 418 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42672 states. [2025-01-09 04:20:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42672 to 42670. [2025-01-09 04:20:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42670 states, 42669 states have (on average 1.4897232182615012) internal successors, (63565), 42669 states have internal predecessors, (63565), 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-01-09 04:20:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42670 states to 42670 states and 63565 transitions. [2025-01-09 04:20:46,917 INFO L78 Accepts]: Start accepts. Automaton has 42670 states and 63565 transitions. Word has length 105 [2025-01-09 04:20:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:46,917 INFO L471 AbstractCegarLoop]: Abstraction has 42670 states and 63565 transitions. [2025-01-09 04:20:46,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-09 04:20:46,918 INFO L276 IsEmpty]: Start isEmpty. Operand 42670 states and 63565 transitions. [2025-01-09 04:20:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:20:46,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:46,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:20:46,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:20:46,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1322141508, now seen corresponding path program 1 times [2025-01-09 04:20:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:46,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907479667] [2025-01-09 04:20:46,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:46,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:46,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:20:46,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:20:46,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:46,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:20:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907479667] [2025-01-09 04:20:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907479667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:46,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439914524] [2025-01-09 04:20:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:47,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:47,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:47,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:47,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:47,001 INFO L87 Difference]: Start difference. First operand 42670 states and 63565 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-01-09 04:20:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:47,859 INFO L93 Difference]: Finished difference Result 127464 states and 189686 transitions. [2025-01-09 04:20:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:47,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 105 [2025-01-09 04:20:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:48,063 INFO L225 Difference]: With dead ends: 127464 [2025-01-09 04:20:48,063 INFO L226 Difference]: Without dead ends: 84897 [2025-01-09 04:20:48,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:48,111 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 117 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:48,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 419 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84897 states. [2025-01-09 04:20:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84897 to 84895. [2025-01-09 04:20:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84895 states, 84894 states have (on average 1.4780078686361815) internal successors, (125474), 84894 states have internal predecessors, (125474), 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-01-09 04:20:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84895 states to 84895 states and 125474 transitions. [2025-01-09 04:20:49,889 INFO L78 Accepts]: Start accepts. Automaton has 84895 states and 125474 transitions. Word has length 105 [2025-01-09 04:20:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:49,889 INFO L471 AbstractCegarLoop]: Abstraction has 84895 states and 125474 transitions. [2025-01-09 04:20:49,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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-01-09 04:20:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 84895 states and 125474 transitions. [2025-01-09 04:20:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:20:49,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:49,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:20:49,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:20:49,893 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1634452203, now seen corresponding path program 1 times [2025-01-09 04:20:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104791320] [2025-01-09 04:20:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:49,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:20:49,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:20:49,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:20:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104791320] [2025-01-09 04:20:49,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104791320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:49,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643365068] [2025-01-09 04:20:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:49,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:49,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:49,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:49,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:49,976 INFO L87 Difference]: Start difference. First operand 84895 states and 125474 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-01-09 04:20:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:51,417 INFO L93 Difference]: Finished difference Result 253607 states and 374428 transitions. [2025-01-09 04:20:51,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:51,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 105 [2025-01-09 04:20:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:51,824 INFO L225 Difference]: With dead ends: 253607 [2025-01-09 04:20:51,824 INFO L226 Difference]: Without dead ends: 168897 [2025-01-09 04:20:51,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:51,903 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 103 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:51,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:20:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168897 states. [2025-01-09 04:20:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168897 to 168895. [2025-01-09 04:20:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168895 states, 168894 states have (on average 1.4661503665020663) internal successors, (247624), 168894 states have internal predecessors, (247624), 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-01-09 04:20:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168895 states to 168895 states and 247624 transitions. [2025-01-09 04:20:55,541 INFO L78 Accepts]: Start accepts. Automaton has 168895 states and 247624 transitions. Word has length 105 [2025-01-09 04:20:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:20:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 168895 states and 247624 transitions. [2025-01-09 04:20:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-01-09 04:20:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 168895 states and 247624 transitions. [2025-01-09 04:20:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:20:55,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:20:55,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:20:55,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:20:55,549 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:20:55,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:20:55,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1177458340, now seen corresponding path program 1 times [2025-01-09 04:20:55,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:20:55,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338963225] [2025-01-09 04:20:55,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:20:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:20:55,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:20:55,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:20:55,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:20:55,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:20:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:20:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:20:55,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338963225] [2025-01-09 04:20:55,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338963225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:20:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:20:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:20:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538968748] [2025-01-09 04:20:55,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:20:55,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:20:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:20:55,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:20:55,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:55,796 INFO L87 Difference]: Start difference. First operand 168895 states and 247624 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-09 04:20:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:20:59,087 INFO L93 Difference]: Finished difference Result 504879 states and 739623 transitions. [2025-01-09 04:20:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:20:59,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2025-01-09 04:20:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:20:59,736 INFO L225 Difference]: With dead ends: 504879 [2025-01-09 04:20:59,736 INFO L226 Difference]: Without dead ends: 336393 [2025-01-09 04:20:59,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:20:59,830 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 137 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:20:59,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 435 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336393 states. [2025-01-09 04:21:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336393 to 336391. [2025-01-09 04:21:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336391 states, 336390 states have (on average 1.4525550700080263) internal successors, (488625), 336390 states have internal predecessors, (488625), 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-01-09 04:21:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336391 states to 336391 states and 488625 transitions. [2025-01-09 04:21:06,256 INFO L78 Accepts]: Start accepts. Automaton has 336391 states and 488625 transitions. Word has length 105 [2025-01-09 04:21:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:06,257 INFO L471 AbstractCegarLoop]: Abstraction has 336391 states and 488625 transitions. [2025-01-09 04:21:06,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-09 04:21:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 336391 states and 488625 transitions. [2025-01-09 04:21:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:21:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:06,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:21:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:21:06,272 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -283972002, now seen corresponding path program 1 times [2025-01-09 04:21:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567206888] [2025-01-09 04:21:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:21:06,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:21:06,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:06,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567206888] [2025-01-09 04:21:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567206888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:06,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497452099] [2025-01-09 04:21:06,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:06,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:06,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:06,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:06,357 INFO L87 Difference]: Start difference. First operand 336391 states and 488625 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-01-09 04:21:10,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:10,134 INFO L93 Difference]: Finished difference Result 505263 states and 732379 transitions. [2025-01-09 04:21:10,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:10,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2025-01-09 04:21:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:10,795 INFO L225 Difference]: With dead ends: 505263 [2025-01-09 04:21:10,796 INFO L226 Difference]: Without dead ends: 336745 [2025-01-09 04:21:10,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:10,930 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 108 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:10,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 474 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336745 states.