./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cc8613549263fa9e280e7172125d1234167e6a3b8c0b538287580172fa36964 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:16:12,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:16:12,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:16:12,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:16:12,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:16:12,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:16:12,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:16:12,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:16:12,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:16:12,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:16:12,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:16:12,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:16:12,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:16:12,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:16:12,459 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:16:12,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:16:12,460 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:16:12,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:12,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:16:12,461 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:16:12,462 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cc8613549263fa9e280e7172125d1234167e6a3b8c0b538287580172fa36964 [2025-03-08 11:16:12,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:16:12,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:16:12,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:16:12,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:16:12,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:16:12,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-03-08 11:16:13,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e1e69b1/abd4aeb8892a4c40995c4ea47260aba0/FLAGe6a498af9 [2025-03-08 11:16:14,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:16:14,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-03-08 11:16:14,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e1e69b1/abd4aeb8892a4c40995c4ea47260aba0/FLAGe6a498af9 [2025-03-08 11:16:14,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e1e69b1/abd4aeb8892a4c40995c4ea47260aba0 [2025-03-08 11:16:14,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:16:14,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:16:14,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:14,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:16:14,079 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:16:14,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67682a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14, skipping insertion in model container [2025-03-08 11:16:14,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:16:14,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i[915,928] [2025-03-08 11:16:14,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:14,342 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:16:14,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i[915,928] [2025-03-08 11:16:14,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:14,428 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:16:14,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14 WrapperNode [2025-03-08 11:16:14,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:14,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:14,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:16:14,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:16:14,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,509 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 655 [2025-03-08 11:16:14,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:14,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:16:14,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:16:14,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:16:14,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,562 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:16:14,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:16:14,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:16:14,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:16:14,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:16:14,597 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:14,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:14,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:16:14,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:16:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:16:14,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:16:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:16:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:16:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:16:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:16:14,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:16:14,746 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:16:15,497 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 11:16:15,497 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:16:15,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:16:15,513 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 11:16:15,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:15 BoogieIcfgContainer [2025-03-08 11:16:15,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:16:15,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:16:15,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:16:15,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:16:15,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:16:14" (1/3) ... [2025-03-08 11:16:15,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dc753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:15, skipping insertion in model container [2025-03-08 11:16:15,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14" (2/3) ... [2025-03-08 11:16:15,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dc753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:15, skipping insertion in model container [2025-03-08 11:16:15,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:15" (3/3) ... [2025-03-08 11:16:15,520 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-03-08 11:16:15,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:16:15,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-0.i that has 2 procedures, 269 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:16:15,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:16:15,593 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;@2178a699, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:16:15,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:16:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 188 states have internal predecessors, (305), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 11:16:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 11:16:15,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:15,620 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:15,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:15,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:15,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2012701189, now seen corresponding path program 1 times [2025-03-08 11:16:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:15,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208861017] [2025-03-08 11:16:15,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:15,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:16:15,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:16:15,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:15,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-03-08 11:16:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208861017] [2025-03-08 11:16:16,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208861017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:16:16,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626810318] [2025-03-08 11:16:16,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:16,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:16:16,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:16,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:16:16,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:16:16,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:16:16,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:16:16,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:16,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:16,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:16:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-03-08 11:16:16,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626810318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:16,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:16:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:16:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088716460] [2025-03-08 11:16:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:16:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:16,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:16:16,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:16,521 INFO L87 Difference]: Start difference. First operand has 269 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 188 states have internal predecessors, (305), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-08 11:16:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:16,580 INFO L93 Difference]: Finished difference Result 530 states and 996 transitions. [2025-03-08 11:16:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:16:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 533 [2025-03-08 11:16:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:16,590 INFO L225 Difference]: With dead ends: 530 [2025-03-08 11:16:16,591 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 11:16:16,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 534 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-03-08 11:16:16,596 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:16,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 11:16:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-08 11:16:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 183 states have (on average 1.6065573770491803) internal successors, (294), 183 states have internal predecessors, (294), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 11:16:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 452 transitions. [2025-03-08 11:16:16,660 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 452 transitions. Word has length 533 [2025-03-08 11:16:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:16,662 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 452 transitions. [2025-03-08 11:16:16,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-08 11:16:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 452 transitions. [2025-03-08 11:16:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 11:16:16,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:16,674 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:16,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:16:16,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:16:16,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:16,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 85821230, now seen corresponding path program 1 times [2025-03-08 11:16:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855608496] [2025-03-08 11:16:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:16,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:16:17,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:16:17,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:17,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855608496] [2025-03-08 11:16:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855608496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:17,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579819373] [2025-03-08 11:16:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:17,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:17,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:17,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:17,320 INFO L87 Difference]: Start difference. First operand 264 states and 452 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:17,424 INFO L93 Difference]: Finished difference Result 750 states and 1280 transitions. [2025-03-08 11:16:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:17,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 11:16:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:17,431 INFO L225 Difference]: With dead ends: 750 [2025-03-08 11:16:17,431 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 11:16:17,432 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-03-08 11:16:17,433 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 369 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:17,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1096 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 11:16:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 334. [2025-03-08 11:16:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 253 states have (on average 1.6640316205533596) internal successors, (421), 253 states have internal predecessors, (421), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 11:16:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 579 transitions. [2025-03-08 11:16:17,479 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 579 transitions. Word has length 533 [2025-03-08 11:16:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:17,482 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 579 transitions. [2025-03-08 11:16:17,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 579 transitions. [2025-03-08 11:16:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 11:16:17,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:17,490 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:17,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:16:17,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:17,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:17,491 INFO L85 PathProgramCache]: Analyzing trace with hash -160491857, now seen corresponding path program 1 times [2025-03-08 11:16:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479382061] [2025-03-08 11:16:17,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:17,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:17,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:16:17,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:16:17,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:17,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:17,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:17,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479382061] [2025-03-08 11:16:17,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479382061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:17,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:17,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073765564] [2025-03-08 11:16:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:17,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:17,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:17,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:17,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:17,874 INFO L87 Difference]: Start difference. First operand 334 states and 579 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:17,946 INFO L93 Difference]: Finished difference Result 820 states and 1403 transitions. [2025-03-08 11:16:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:17,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 11:16:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:17,950 INFO L225 Difference]: With dead ends: 820 [2025-03-08 11:16:17,951 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 11:16:17,952 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-03-08 11:16:17,954 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 362 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:17,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 897 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 11:16:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 334. [2025-03-08 11:16:17,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 253 states have (on average 1.6442687747035574) internal successors, (416), 253 states have internal predecessors, (416), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-08 11:16:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 574 transitions. [2025-03-08 11:16:17,985 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 574 transitions. Word has length 533 [2025-03-08 11:16:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:17,986 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 574 transitions. [2025-03-08 11:16:17,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 574 transitions. [2025-03-08 11:16:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-08 11:16:17,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:17,992 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:17,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:16:17,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:17,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -588851121, now seen corresponding path program 1 times [2025-03-08 11:16:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784067308] [2025-03-08 11:16:17,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:18,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-08 11:16:18,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-08 11:16:18,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:18,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784067308] [2025-03-08 11:16:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784067308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:18,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522228779] [2025-03-08 11:16:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:18,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:18,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:18,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:18,333 INFO L87 Difference]: Start difference. First operand 334 states and 574 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:18,417 INFO L93 Difference]: Finished difference Result 996 states and 1716 transitions. [2025-03-08 11:16:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:18,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-03-08 11:16:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:18,425 INFO L225 Difference]: With dead ends: 996 [2025-03-08 11:16:18,426 INFO L226 Difference]: Without dead ends: 665 [2025-03-08 11:16:18,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:18,430 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 304 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:18,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1307 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-08 11:16:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-08 11:16:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 502 states have (on average 1.6454183266932272) internal successors, (826), 502 states have internal predecessors, (826), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-08 11:16:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1142 transitions. [2025-03-08 11:16:18,481 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1142 transitions. Word has length 533 [2025-03-08 11:16:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:18,483 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1142 transitions. [2025-03-08 11:16:18,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1142 transitions. [2025-03-08 11:16:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:18,492 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:18,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:16:18,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:18,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1736420503, now seen corresponding path program 1 times [2025-03-08 11:16:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108824764] [2025-03-08 11:16:18,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:18,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:18,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:18,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:18,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:19,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108824764] [2025-03-08 11:16:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108824764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:19,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:19,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:16:19,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662393894] [2025-03-08 11:16:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:19,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:19,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:19,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:19,036 INFO L87 Difference]: Start difference. First operand 663 states and 1142 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:19,467 INFO L93 Difference]: Finished difference Result 1821 states and 3147 transitions. [2025-03-08 11:16:19,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:19,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-03-08 11:16:19,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:19,474 INFO L225 Difference]: With dead ends: 1821 [2025-03-08 11:16:19,474 INFO L226 Difference]: Without dead ends: 1161 [2025-03-08 11:16:19,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:16:19,477 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 432 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:19,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1595 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:16:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-08 11:16:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1129. [2025-03-08 11:16:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 888 states have (on average 1.6745495495495495) internal successors, (1487), 888 states have internal predecessors, (1487), 237 states have call successors, (237), 3 states have call predecessors, (237), 3 states have return successors, (237), 237 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-08 11:16:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1961 transitions. [2025-03-08 11:16:19,559 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1961 transitions. Word has length 534 [2025-03-08 11:16:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:19,561 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1961 transitions. [2025-03-08 11:16:19,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1961 transitions. [2025-03-08 11:16:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:19,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:19,568 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:19,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:16:19,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:19,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1443017496, now seen corresponding path program 1 times [2025-03-08 11:16:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:19,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501649066] [2025-03-08 11:16:19,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:19,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:19,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:20,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501649066] [2025-03-08 11:16:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501649066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:20,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:16:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598200713] [2025-03-08 11:16:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:20,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:16:20,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:20,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:16:20,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:16:20,086 INFO L87 Difference]: Start difference. First operand 1129 states and 1961 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-08 11:16:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:21,144 INFO L93 Difference]: Finished difference Result 3431 states and 5948 transitions. [2025-03-08 11:16:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 534 [2025-03-08 11:16:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:21,156 INFO L225 Difference]: With dead ends: 3431 [2025-03-08 11:16:21,156 INFO L226 Difference]: Without dead ends: 2699 [2025-03-08 11:16:21,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:16:21,159 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1124 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:21,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 1531 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:16:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2025-03-08 11:16:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2693. [2025-03-08 11:16:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2214 states have (on average 1.6833785004516713) internal successors, (3727), 2216 states have internal predecessors, (3727), 471 states have call successors, (471), 7 states have call predecessors, (471), 7 states have return successors, (471), 469 states have call predecessors, (471), 471 states have call successors, (471) [2025-03-08 11:16:21,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4669 transitions. [2025-03-08 11:16:21,304 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4669 transitions. Word has length 534 [2025-03-08 11:16:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:21,305 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4669 transitions. [2025-03-08 11:16:21,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-08 11:16:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4669 transitions. [2025-03-08 11:16:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:21,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:21,309 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:21,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:16:21,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:21,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:21,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2136119193, now seen corresponding path program 1 times [2025-03-08 11:16:21,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:21,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82256606] [2025-03-08 11:16:21,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:21,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:21,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:21,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:21,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:22,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82256606] [2025-03-08 11:16:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82256606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:22,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:16:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294614458] [2025-03-08 11:16:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:16:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:22,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:16:22,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:16:22,500 INFO L87 Difference]: Start difference. First operand 2693 states and 4669 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-03-08 11:16:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:23,686 INFO L93 Difference]: Finished difference Result 11122 states and 19225 transitions. [2025-03-08 11:16:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:16:23,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 534 [2025-03-08 11:16:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:23,724 INFO L225 Difference]: With dead ends: 11122 [2025-03-08 11:16:23,724 INFO L226 Difference]: Without dead ends: 9136 [2025-03-08 11:16:23,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:16:23,732 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 1470 mSDsluCounter, 1754 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:23,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 2441 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:16:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9136 states. [2025-03-08 11:16:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9136 to 7946. [2025-03-08 11:16:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7946 states, 6827 states have (on average 1.7025047605097408) internal successors, (11623), 6837 states have internal predecessors, (11623), 1099 states have call successors, (1099), 19 states have call predecessors, (1099), 19 states have return successors, (1099), 1089 states have call predecessors, (1099), 1099 states have call successors, (1099) [2025-03-08 11:16:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7946 states to 7946 states and 13821 transitions. [2025-03-08 11:16:24,088 INFO L78 Accepts]: Start accepts. Automaton has 7946 states and 13821 transitions. Word has length 534 [2025-03-08 11:16:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:24,089 INFO L471 AbstractCegarLoop]: Abstraction has 7946 states and 13821 transitions. [2025-03-08 11:16:24,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-03-08 11:16:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7946 states and 13821 transitions. [2025-03-08 11:16:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:24,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:24,098 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:24,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:16:24,098 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:24,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 969422874, now seen corresponding path program 1 times [2025-03-08 11:16:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294116208] [2025-03-08 11:16:24,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:24,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:24,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:24,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:24,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:26,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294116208] [2025-03-08 11:16:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294116208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:26,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:26,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 11:16:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022506882] [2025-03-08 11:16:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:26,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:16:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:26,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:16:26,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:16:26,267 INFO L87 Difference]: Start difference. First operand 7946 states and 13821 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:29,147 INFO L93 Difference]: Finished difference Result 25042 states and 43297 transitions. [2025-03-08 11:16:29,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:16:29,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-03-08 11:16:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:29,221 INFO L225 Difference]: With dead ends: 25042 [2025-03-08 11:16:29,222 INFO L226 Difference]: Without dead ends: 19696 [2025-03-08 11:16:29,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:16:29,240 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1793 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2667 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:29,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2667 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 11:16:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19696 states. [2025-03-08 11:16:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19696 to 19666. [2025-03-08 11:16:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19666 states, 17382 states have (on average 1.7054424116902542) internal successors, (29644), 17422 states have internal predecessors, (29644), 2203 states have call successors, (2203), 80 states have call predecessors, (2203), 80 states have return successors, (2203), 2163 states have call predecessors, (2203), 2203 states have call successors, (2203) [2025-03-08 11:16:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19666 states to 19666 states and 34050 transitions. [2025-03-08 11:16:29,987 INFO L78 Accepts]: Start accepts. Automaton has 19666 states and 34050 transitions. Word has length 534 [2025-03-08 11:16:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:29,988 INFO L471 AbstractCegarLoop]: Abstraction has 19666 states and 34050 transitions. [2025-03-08 11:16:29,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 19666 states and 34050 transitions. [2025-03-08 11:16:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:30,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:30,002 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:16:30,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:30,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:30,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1931036891, now seen corresponding path program 1 times [2025-03-08 11:16:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362847907] [2025-03-08 11:16:30,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:30,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:30,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:30,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362847907] [2025-03-08 11:16:30,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362847907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:30,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:30,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:16:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068007209] [2025-03-08 11:16:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:30,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:30,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:30,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:30,691 INFO L87 Difference]: Start difference. First operand 19666 states and 34050 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-08 11:16:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:31,899 INFO L93 Difference]: Finished difference Result 47080 states and 80890 transitions. [2025-03-08 11:16:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:16:31,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 534 [2025-03-08 11:16:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:31,999 INFO L225 Difference]: With dead ends: 47080 [2025-03-08 11:16:32,000 INFO L226 Difference]: Without dead ends: 32936 [2025-03-08 11:16:32,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:16:32,037 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 523 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:32,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1352 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32936 states. [2025-03-08 11:16:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32936 to 32934. [2025-03-08 11:16:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32934 states, 28846 states have (on average 1.6896623448658392) internal successors, (48740), 28924 states have internal predecessors, (48740), 3935 states have call successors, (3935), 152 states have call predecessors, (3935), 152 states have return successors, (3935), 3857 states have call predecessors, (3935), 3935 states have call successors, (3935) [2025-03-08 11:16:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32934 states to 32934 states and 56610 transitions. [2025-03-08 11:16:33,332 INFO L78 Accepts]: Start accepts. Automaton has 32934 states and 56610 transitions. Word has length 534 [2025-03-08 11:16:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:33,333 INFO L471 AbstractCegarLoop]: Abstraction has 32934 states and 56610 transitions. [2025-03-08 11:16:33,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-08 11:16:33,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32934 states and 56610 transitions. [2025-03-08 11:16:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:33,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:33,355 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:16:33,356 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2134795129, now seen corresponding path program 1 times [2025-03-08 11:16:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723483246] [2025-03-08 11:16:33,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:33,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:33,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:33,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:33,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723483246] [2025-03-08 11:16:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723483246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:33,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312993294] [2025-03-08 11:16:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:33,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:33,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:33,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:33,862 INFO L87 Difference]: Start difference. First operand 32934 states and 56610 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:36,270 INFO L93 Difference]: Finished difference Result 77134 states and 131147 transitions. [2025-03-08 11:16:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:16:36,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-03-08 11:16:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:36,450 INFO L225 Difference]: With dead ends: 77134 [2025-03-08 11:16:36,451 INFO L226 Difference]: Without dead ends: 55440 [2025-03-08 11:16:36,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:36,516 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 477 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:36,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1323 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:16:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55440 states. [2025-03-08 11:16:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55440 to 54356. [2025-03-08 11:16:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54356 states, 46262 states have (on average 1.6681077342095023) internal successors, (77170), 46418 states have internal predecessors, (77170), 7791 states have call successors, (7791), 302 states have call predecessors, (7791), 302 states have return successors, (7791), 7635 states have call predecessors, (7791), 7791 states have call successors, (7791) [2025-03-08 11:16:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54356 states to 54356 states and 92752 transitions. [2025-03-08 11:16:39,029 INFO L78 Accepts]: Start accepts. Automaton has 54356 states and 92752 transitions. Word has length 534 [2025-03-08 11:16:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:39,030 INFO L471 AbstractCegarLoop]: Abstraction has 54356 states and 92752 transitions. [2025-03-08 11:16:39,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54356 states and 92752 transitions. [2025-03-08 11:16:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:39,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:39,051 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:39,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:16:39,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:39,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:39,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1624260952, now seen corresponding path program 1 times [2025-03-08 11:16:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:39,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171716384] [2025-03-08 11:16:39,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:39,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:39,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:39,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171716384] [2025-03-08 11:16:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171716384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721984481] [2025-03-08 11:16:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:39,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:39,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:39,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:39,548 INFO L87 Difference]: Start difference. First operand 54356 states and 92752 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:44,718 INFO L93 Difference]: Finished difference Result 160431 states and 269359 transitions. [2025-03-08 11:16:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:16:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-03-08 11:16:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:45,053 INFO L225 Difference]: With dead ends: 160431 [2025-03-08 11:16:45,053 INFO L226 Difference]: Without dead ends: 110145 [2025-03-08 11:16:45,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:45,163 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 936 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:45,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1451 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:16:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110145 states. [2025-03-08 11:16:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110145 to 63863. [2025-03-08 11:16:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63863 states, 55769 states have (on average 1.6839462783983934) internal successors, (93912), 55925 states have internal predecessors, (93912), 7791 states have call successors, (7791), 302 states have call predecessors, (7791), 302 states have return successors, (7791), 7635 states have call predecessors, (7791), 7791 states have call successors, (7791) [2025-03-08 11:16:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63863 states to 63863 states and 109494 transitions. [2025-03-08 11:16:49,148 INFO L78 Accepts]: Start accepts. Automaton has 63863 states and 109494 transitions. Word has length 534 [2025-03-08 11:16:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:49,149 INFO L471 AbstractCegarLoop]: Abstraction has 63863 states and 109494 transitions. [2025-03-08 11:16:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63863 states and 109494 transitions. [2025-03-08 11:16:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:49,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:49,169 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:49,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:16:49,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:49,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:49,170 INFO L85 PathProgramCache]: Analyzing trace with hash 460670009, now seen corresponding path program 1 times [2025-03-08 11:16:49,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:49,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734923022] [2025-03-08 11:16:49,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:49,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:49,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:49,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:49,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:49,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:49,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734923022] [2025-03-08 11:16:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734923022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:49,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871317546] [2025-03-08 11:16:49,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:49,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:49,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:49,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:49,391 INFO L87 Difference]: Start difference. First operand 63863 states and 109494 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:52,155 INFO L93 Difference]: Finished difference Result 143527 states and 246188 transitions. [2025-03-08 11:16:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:52,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-03-08 11:16:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:52,348 INFO L225 Difference]: With dead ends: 143527 [2025-03-08 11:16:52,348 INFO L226 Difference]: Without dead ends: 84877 [2025-03-08 11:16:52,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-08 11:16:52,428 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 314 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:52,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1075 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84877 states. [2025-03-08 11:16:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84877 to 84875. [2025-03-08 11:16:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84875 states, 73893 states have (on average 1.6879000717253325) internal successors, (124724), 74097 states have internal predecessors, (124724), 10579 states have call successors, (10579), 402 states have call predecessors, (10579), 402 states have return successors, (10579), 10375 states have call predecessors, (10579), 10579 states have call successors, (10579) [2025-03-08 11:16:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84875 states to 84875 states and 145882 transitions. [2025-03-08 11:16:56,853 INFO L78 Accepts]: Start accepts. Automaton has 84875 states and 145882 transitions. Word has length 534 [2025-03-08 11:16:56,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:56,854 INFO L471 AbstractCegarLoop]: Abstraction has 84875 states and 145882 transitions. [2025-03-08 11:16:56,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:16:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 84875 states and 145882 transitions. [2025-03-08 11:16:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:16:56,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:56,874 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:16:56,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:56,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1020569545, now seen corresponding path program 1 times [2025-03-08 11:16:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660333635] [2025-03-08 11:16:56,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:56,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:56,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:16:56,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:16:56,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:56,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:16:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660333635] [2025-03-08 11:16:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660333635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:57,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:16:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123287932] [2025-03-08 11:16:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:16:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:16:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:57,305 INFO L87 Difference]: Start difference. First operand 84875 states and 145882 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:17:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:17:03,757 INFO L93 Difference]: Finished difference Result 316413 states and 542817 transitions. [2025-03-08 11:17:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:17:03,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-03-08 11:17:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:17:04,201 INFO L225 Difference]: With dead ends: 316413 [2025-03-08 11:17:04,201 INFO L226 Difference]: Without dead ends: 239079 [2025-03-08 11:17:04,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:17:04,354 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 595 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:17:04,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 2252 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:17:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239079 states. [2025-03-08 11:17:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239079 to 177649. [2025-03-08 11:17:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177649 states, 163066 states have (on average 1.7122576134816578) internal successors, (279211), 163510 states have internal predecessors, (279211), 13939 states have call successors, (13939), 643 states have call predecessors, (13939), 643 states have return successors, (13939), 13495 states have call predecessors, (13939), 13939 states have call successors, (13939) [2025-03-08 11:17:10,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177649 states to 177649 states and 307089 transitions. [2025-03-08 11:17:11,021 INFO L78 Accepts]: Start accepts. Automaton has 177649 states and 307089 transitions. Word has length 534 [2025-03-08 11:17:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:17:11,022 INFO L471 AbstractCegarLoop]: Abstraction has 177649 states and 307089 transitions. [2025-03-08 11:17:11,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-08 11:17:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 177649 states and 307089 transitions. [2025-03-08 11:17:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-08 11:17:11,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:17:11,080 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:17:11,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:17:11,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:17:11,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:17:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash 680170934, now seen corresponding path program 1 times [2025-03-08 11:17:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:17:11,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143092974] [2025-03-08 11:17:11,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:17:11,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:17:11,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-08 11:17:11,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-08 11:17:11,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:17:11,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:17:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-08 11:17:11,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:17:11,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143092974] [2025-03-08 11:17:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143092974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:17:11,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:17:11,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:17:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339291248] [2025-03-08 11:17:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:17:11,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:17:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:17:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:17:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:17:11,637 INFO L87 Difference]: Start difference. First operand 177649 states and 307089 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79)