./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-69.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 96d87045534f1cc5b0e028ec5065a5ac2be4d13286f56c464cccf7714dd6ef42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:35:29,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:35:29,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:35:29,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:35:29,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:35:29,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:35:29,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:35:29,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:35:29,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:35:29,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:35:29,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:35:29,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:35:29,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:35:29,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:35:29,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:35:29,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:35:29,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:35:29,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:35:29,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:35:29,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:35:29,950 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 -> 96d87045534f1cc5b0e028ec5065a5ac2be4d13286f56c464cccf7714dd6ef42 [2025-03-04 00:35:30,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:35:30,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:35:30,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:35:30,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:35:30,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:35:30,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-69.i [2025-03-04 00:35:31,328 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dca0932/0ef27fc5016e428fa59c121e1079d4f8/FLAG34e22ef00 [2025-03-04 00:35:31,621 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:35:31,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-69.i [2025-03-04 00:35:31,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dca0932/0ef27fc5016e428fa59c121e1079d4f8/FLAG34e22ef00 [2025-03-04 00:35:31,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6dca0932/0ef27fc5016e428fa59c121e1079d4f8 [2025-03-04 00:35:31,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:35:31,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:35:31,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:35:31,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:35:31,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:35:31,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:31" (1/1) ... [2025-03-04 00:35:31,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61706ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:31, skipping insertion in model container [2025-03-04 00:35:31,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:35:31" (1/1) ... [2025-03-04 00:35:31,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:35:31,814 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_operatoramount_amount500_file-69.i[916,929] [2025-03-04 00:35:31,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:35:31,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:35:31,987 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_operatoramount_amount500_file-69.i[916,929] [2025-03-04 00:35:32,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:35:32,111 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:35:32,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32 WrapperNode [2025-03-04 00:35:32,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:35:32,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:35:32,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:35:32,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:35:32,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,213 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 796 [2025-03-04 00:35:32,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:35:32,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:35:32,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:35:32,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:35:32,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,311 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-04 00:35:32,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:35:32,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:35:32,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:35:32,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:35:32,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (1/1) ... [2025-03-04 00:35:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:35:32,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:32,400 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-04 00:35:32,402 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-04 00:35:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:35:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:35:32,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:35:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:35:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:35:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:35:32,548 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:35:32,549 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:35:33,444 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L604: havoc property_#t~bitwise53#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short57#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1;havoc property_#t~bitwise64#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~short67#1;havoc property_#t~bitwise68#1;havoc property_#t~short69#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~ite71#1;havoc property_#t~bitwise70#1;havoc property_#t~short74#1;havoc property_#t~ite78#1;havoc property_#t~ite77#1;havoc property_#t~bitwise75#1;havoc property_#t~bitwise76#1;havoc property_#t~short79#1; [2025-03-04 00:35:33,576 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-04 00:35:33,577 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:35:33,606 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:35:33,609 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:35:33,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:33 BoogieIcfgContainer [2025-03-04 00:35:33,609 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:35:33,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:35:33,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:35:33,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:35:33,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:35:31" (1/3) ... [2025-03-04 00:35:33,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7fe0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:33, skipping insertion in model container [2025-03-04 00:35:33,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:35:32" (2/3) ... [2025-03-04 00:35:33,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7fe0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:35:33, skipping insertion in model container [2025-03-04 00:35:33,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:35:33" (3/3) ... [2025-03-04 00:35:33,617 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-69.i [2025-03-04 00:35:33,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:35:33,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-69.i that has 2 procedures, 323 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:35:33,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:35:33,707 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;@57d9d20a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:35:33,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:35:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 253 states have (on average 1.5612648221343874) internal successors, (395), 254 states have internal predecessors, (395), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:35:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-04 00:35:33,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:33,737 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:33,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:33,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 245893548, now seen corresponding path program 1 times [2025-03-04 00:35:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043047662] [2025-03-04 00:35:33,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:33,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-04 00:35:33,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-04 00:35:33,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:33,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-04 00:35:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043047662] [2025-03-04 00:35:34,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043047662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:35:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974994768] [2025-03-04 00:35:34,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:34,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:35:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:35:34,263 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-04 00:35:34,264 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-04 00:35:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-04 00:35:34,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-04 00:35:34,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:34,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:34,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:35:34,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:35:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-04 00:35:34,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:35:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974994768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:34,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:35:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:35:34,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850350513] [2025-03-04 00:35:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:34,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:35:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:34,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:35:34,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:35:34,635 INFO L87 Difference]: Start difference. First operand has 323 states, 253 states have (on average 1.5612648221343874) internal successors, (395), 254 states have internal predecessors, (395), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:35:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:34,717 INFO L93 Difference]: Finished difference Result 640 states and 1120 transitions. [2025-03-04 00:35:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:35:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 461 [2025-03-04 00:35:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:34,729 INFO L225 Difference]: With dead ends: 640 [2025-03-04 00:35:34,730 INFO L226 Difference]: Without dead ends: 320 [2025-03-04 00:35:34,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 462 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-04 00:35:34,740 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:34,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 504 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:35:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-03-04 00:35:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2025-03-04 00:35:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 251 states have (on average 1.5537848605577689) internal successors, (390), 251 states have internal predecessors, (390), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 00:35:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 524 transitions. [2025-03-04 00:35:34,814 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 524 transitions. Word has length 461 [2025-03-04 00:35:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:34,815 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 524 transitions. [2025-03-04 00:35:34,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:35:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 524 transitions. [2025-03-04 00:35:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-04 00:35:34,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:34,827 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:34,835 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-04 00:35:35,032 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-04 00:35:35,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:35,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash -402867797, now seen corresponding path program 1 times [2025-03-04 00:35:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:35,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258146034] [2025-03-04 00:35:35,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:35,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-04 00:35:35,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-04 00:35:35,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:35,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258146034] [2025-03-04 00:35:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258146034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:35,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:35,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656329813] [2025-03-04 00:35:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:35,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:35,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:35,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:35,511 INFO L87 Difference]: Start difference. First operand 320 states and 524 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:35,669 INFO L93 Difference]: Finished difference Result 949 states and 1556 transitions. [2025-03-04 00:35:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 461 [2025-03-04 00:35:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:35,679 INFO L225 Difference]: With dead ends: 949 [2025-03-04 00:35:35,680 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 00:35:35,681 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-04 00:35:35,682 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 510 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:35,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 973 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 00:35:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2025-03-04 00:35:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 491 states have (on average 1.5458248472505092) internal successors, (759), 491 states have internal predecessors, (759), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-04 00:35:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1027 transitions. [2025-03-04 00:35:35,771 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1027 transitions. Word has length 461 [2025-03-04 00:35:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:35,772 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 1027 transitions. [2025-03-04 00:35:35,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1027 transitions. [2025-03-04 00:35:35,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-04 00:35:35,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:35,779 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:35,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:35:35,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:35,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1538518269, now seen corresponding path program 1 times [2025-03-04 00:35:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:35,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338919609] [2025-03-04 00:35:35,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:35,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:35,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-04 00:35:35,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-04 00:35:35,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:35,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338919609] [2025-03-04 00:35:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338919609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126079583] [2025-03-04 00:35:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:36,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:36,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:36,138 INFO L87 Difference]: Start difference. First operand 628 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:36,298 INFO L93 Difference]: Finished difference Result 1842 states and 3015 transitions. [2025-03-04 00:35:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 462 [2025-03-04 00:35:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:36,309 INFO L225 Difference]: With dead ends: 1842 [2025-03-04 00:35:36,310 INFO L226 Difference]: Without dead ends: 1217 [2025-03-04 00:35:36,314 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-04 00:35:36,316 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 471 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:36,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1294 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-03-04 00:35:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1215. [2025-03-04 00:35:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 942 states have (on average 1.5286624203821657) internal successors, (1440), 942 states have internal predecessors, (1440), 268 states have call successors, (268), 4 states have call predecessors, (268), 4 states have return successors, (268), 268 states have call predecessors, (268), 268 states have call successors, (268) [2025-03-04 00:35:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1976 transitions. [2025-03-04 00:35:36,436 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1976 transitions. Word has length 462 [2025-03-04 00:35:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:36,438 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1976 transitions. [2025-03-04 00:35:36,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1976 transitions. [2025-03-04 00:35:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-04 00:35:36,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:36,446 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:36,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:35:36,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:36,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash -917779131, now seen corresponding path program 1 times [2025-03-04 00:35:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385705454] [2025-03-04 00:35:36,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-04 00:35:36,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-04 00:35:36,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:36,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:37,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:37,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:37,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385705454] [2025-03-04 00:35:37,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385705454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:37,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:37,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:37,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458536875] [2025-03-04 00:35:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:37,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:37,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:37,134 INFO L87 Difference]: Start difference. First operand 1215 states and 1976 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:37,209 INFO L93 Difference]: Finished difference Result 2427 states and 3949 transitions. [2025-03-04 00:35:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 462 [2025-03-04 00:35:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:37,217 INFO L225 Difference]: With dead ends: 2427 [2025-03-04 00:35:37,217 INFO L226 Difference]: Without dead ends: 1215 [2025-03-04 00:35:37,220 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-04 00:35:37,221 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:37,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 997 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:35:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-03-04 00:35:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2025-03-04 00:35:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 942 states have (on average 1.5244161358811041) internal successors, (1436), 942 states have internal predecessors, (1436), 268 states have call successors, (268), 4 states have call predecessors, (268), 4 states have return successors, (268), 268 states have call predecessors, (268), 268 states have call successors, (268) [2025-03-04 00:35:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1972 transitions. [2025-03-04 00:35:37,290 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1972 transitions. Word has length 462 [2025-03-04 00:35:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:37,290 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1972 transitions. [2025-03-04 00:35:37,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1972 transitions. [2025-03-04 00:35:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-04 00:35:37,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:37,296 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:37,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:35:37,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:37,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash -287320506, now seen corresponding path program 1 times [2025-03-04 00:35:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:37,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948616502] [2025-03-04 00:35:37,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:37,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:37,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-04 00:35:37,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-04 00:35:37,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:37,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:38,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948616502] [2025-03-04 00:35:38,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948616502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:38,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:35:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031412781] [2025-03-04 00:35:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:35:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:38,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:35:38,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:35:38,184 INFO L87 Difference]: Start difference. First operand 1215 states and 1972 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:35:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:39,091 INFO L93 Difference]: Finished difference Result 4843 states and 7848 transitions. [2025-03-04 00:35:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:35:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 462 [2025-03-04 00:35:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:39,107 INFO L225 Difference]: With dead ends: 4843 [2025-03-04 00:35:39,108 INFO L226 Difference]: Without dead ends: 3631 [2025-03-04 00:35:39,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:35:39,113 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1647 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:39,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 2339 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:35:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2025-03-04 00:35:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 2677. [2025-03-04 00:35:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2132 states have (on average 1.5384615384615385) internal successors, (3280), 2132 states have internal predecessors, (3280), 536 states have call successors, (536), 8 states have call predecessors, (536), 8 states have return successors, (536), 536 states have call predecessors, (536), 536 states have call successors, (536) [2025-03-04 00:35:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 4352 transitions. [2025-03-04 00:35:39,290 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 4352 transitions. Word has length 462 [2025-03-04 00:35:39,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:39,290 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 4352 transitions. [2025-03-04 00:35:39,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:35:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 4352 transitions. [2025-03-04 00:35:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-04 00:35:39,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:39,297 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:39,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:35:39,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:39,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1438160391, now seen corresponding path program 1 times [2025-03-04 00:35:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884552708] [2025-03-04 00:35:39,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-04 00:35:39,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-04 00:35:39,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:39,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:40,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:40,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884552708] [2025-03-04 00:35:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884552708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:40,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:40,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:35:40,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661732626] [2025-03-04 00:35:40,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:40,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:35:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:40,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:35:40,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:40,262 INFO L87 Difference]: Start difference. First operand 2677 states and 4352 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:40,807 INFO L93 Difference]: Finished difference Result 6815 states and 11082 transitions. [2025-03-04 00:35:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 462 [2025-03-04 00:35:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:40,828 INFO L225 Difference]: With dead ends: 6815 [2025-03-04 00:35:40,829 INFO L226 Difference]: Without dead ends: 4141 [2025-03-04 00:35:40,836 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-04 00:35:40,837 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 589 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:40,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1332 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:35:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-03-04 00:35:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4135. [2025-03-04 00:35:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4135 states, 3318 states have (on average 1.5394816154309825) internal successors, (5108), 3318 states have internal predecessors, (5108), 804 states have call successors, (804), 12 states have call predecessors, (804), 12 states have return successors, (804), 804 states have call predecessors, (804), 804 states have call successors, (804) [2025-03-04 00:35:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 6716 transitions. [2025-03-04 00:35:41,038 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 6716 transitions. Word has length 462 [2025-03-04 00:35:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:41,038 INFO L471 AbstractCegarLoop]: Abstraction has 4135 states and 6716 transitions. [2025-03-04 00:35:41,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 6716 transitions. [2025-03-04 00:35:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-04 00:35:41,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:41,048 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:41,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:35:41,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:41,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 563794243, now seen corresponding path program 1 times [2025-03-04 00:35:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018883800] [2025-03-04 00:35:41,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:41,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:41,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 00:35:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 00:35:41,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:41,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:41,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018883800] [2025-03-04 00:35:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018883800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:41,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:35:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035609690] [2025-03-04 00:35:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:41,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:35:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:41,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:35:41,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:35:41,561 INFO L87 Difference]: Start difference. First operand 4135 states and 6716 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:42,019 INFO L93 Difference]: Finished difference Result 11689 states and 18971 transitions. [2025-03-04 00:35:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:35:42,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 463 [2025-03-04 00:35:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:42,056 INFO L225 Difference]: With dead ends: 11689 [2025-03-04 00:35:42,056 INFO L226 Difference]: Without dead ends: 7557 [2025-03-04 00:35:42,069 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-04 00:35:42,070 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 698 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:42,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1739 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:35:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7557 states. [2025-03-04 00:35:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7557 to 6189. [2025-03-04 00:35:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6189 states, 4964 states have (on average 1.5312248186946011) internal successors, (7601), 4964 states have internal predecessors, (7601), 1206 states have call successors, (1206), 18 states have call predecessors, (1206), 18 states have return successors, (1206), 1206 states have call predecessors, (1206), 1206 states have call successors, (1206) [2025-03-04 00:35:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6189 states to 6189 states and 10013 transitions. [2025-03-04 00:35:42,446 INFO L78 Accepts]: Start accepts. Automaton has 6189 states and 10013 transitions. Word has length 463 [2025-03-04 00:35:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:42,447 INFO L471 AbstractCegarLoop]: Abstraction has 6189 states and 10013 transitions. [2025-03-04 00:35:42,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6189 states and 10013 transitions. [2025-03-04 00:35:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-04 00:35:42,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:42,453 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:42,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:35:42,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:42,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -178177068, now seen corresponding path program 1 times [2025-03-04 00:35:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119960438] [2025-03-04 00:35:42,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:42,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 00:35:42,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 00:35:42,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:42,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119960438] [2025-03-04 00:35:43,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119960438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:43,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:43,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:35:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175504164] [2025-03-04 00:35:43,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:35:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:43,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:35:43,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:35:43,243 INFO L87 Difference]: Start difference. First operand 6189 states and 10013 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:43,672 INFO L93 Difference]: Finished difference Result 18561 states and 30033 transitions. [2025-03-04 00:35:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:35:43,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 463 [2025-03-04 00:35:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:43,720 INFO L225 Difference]: With dead ends: 18561 [2025-03-04 00:35:43,721 INFO L226 Difference]: Without dead ends: 12375 [2025-03-04 00:35:43,741 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-04 00:35:43,742 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 343 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:43,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1083 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:35:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12375 states. [2025-03-04 00:35:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12375 to 12355. [2025-03-04 00:35:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12355 states, 9906 states have (on average 1.526953361599031) internal successors, (15126), 9906 states have internal predecessors, (15126), 2412 states have call successors, (2412), 36 states have call predecessors, (2412), 36 states have return successors, (2412), 2412 states have call predecessors, (2412), 2412 states have call successors, (2412) [2025-03-04 00:35:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12355 states to 12355 states and 19950 transitions. [2025-03-04 00:35:44,305 INFO L78 Accepts]: Start accepts. Automaton has 12355 states and 19950 transitions. Word has length 463 [2025-03-04 00:35:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:44,306 INFO L471 AbstractCegarLoop]: Abstraction has 12355 states and 19950 transitions. [2025-03-04 00:35:44,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:35:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 12355 states and 19950 transitions. [2025-03-04 00:35:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-04 00:35:44,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:44,354 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:44,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:35:44,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:44,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:44,355 INFO L85 PathProgramCache]: Analyzing trace with hash -252871090, now seen corresponding path program 1 times [2025-03-04 00:35:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:44,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509727657] [2025-03-04 00:35:44,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:44,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-04 00:35:45,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-04 00:35:45,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:45,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:35:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:35:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:35:46,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509727657] [2025-03-04 00:35:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509727657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:35:46,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:35:46,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:35:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919235731] [2025-03-04 00:35:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:35:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:35:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:35:46,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:35:46,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:35:46,510 INFO L87 Difference]: Start difference. First operand 12355 states and 19950 transitions. Second operand has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:35:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:35:48,333 INFO L93 Difference]: Finished difference Result 38239 states and 61158 transitions. [2025-03-04 00:35:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:35:48,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 464 [2025-03-04 00:35:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:35:48,397 INFO L225 Difference]: With dead ends: 38239 [2025-03-04 00:35:48,397 INFO L226 Difference]: Without dead ends: 25887 [2025-03-04 00:35:48,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:35:48,427 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 1527 mSDsluCounter, 2007 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:35:48,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 2601 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:35:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25887 states. [2025-03-04 00:35:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25887 to 14997. [2025-03-04 00:35:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14997 states, 12548 states have (on average 1.5592923175007969) internal successors, (19566), 12548 states have internal predecessors, (19566), 2412 states have call successors, (2412), 36 states have call predecessors, (2412), 36 states have return successors, (2412), 2412 states have call predecessors, (2412), 2412 states have call successors, (2412) [2025-03-04 00:35:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 24390 transitions. [2025-03-04 00:35:49,273 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 24390 transitions. Word has length 464 [2025-03-04 00:35:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:35:49,274 INFO L471 AbstractCegarLoop]: Abstraction has 14997 states and 24390 transitions. [2025-03-04 00:35:49,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-04 00:35:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 24390 transitions. [2025-03-04 00:35:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-04 00:35:49,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:35:49,283 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:35:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:35:49,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:35:49,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:35:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -849119605, now seen corresponding path program 1 times [2025-03-04 00:35:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:35:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220852898] [2025-03-04 00:35:49,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:35:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:35:49,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-04 00:35:50,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-04 00:35:50,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:35:50,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:36:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220852898] [2025-03-04 00:36:03,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220852898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:03,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:03,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 00:36:03,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471226659] [2025-03-04 00:36:03,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:03,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:36:03,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:03,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:36:03,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:36:03,745 INFO L87 Difference]: Start difference. First operand 14997 states and 24390 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-04 00:36:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:11,115 INFO L93 Difference]: Finished difference Result 64121 states and 103420 transitions. [2025-03-04 00:36:11,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:36:11,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) Word has length 464 [2025-03-04 00:36:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:11,273 INFO L225 Difference]: With dead ends: 64121 [2025-03-04 00:36:11,274 INFO L226 Difference]: Without dead ends: 49127 [2025-03-04 00:36:11,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:36:11,323 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 3647 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 4175 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3647 SdHoareTripleChecker+Valid, 5763 SdHoareTripleChecker+Invalid, 4749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 4175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:11,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3647 Valid, 5763 Invalid, 4749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 4175 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-04 00:36:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49127 states. [2025-03-04 00:36:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49127 to 35669. [2025-03-04 00:36:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35669 states, 29956 states have (on average 1.5526104953932434) internal successors, (46510), 29956 states have internal predecessors, (46510), 5628 states have call successors, (5628), 84 states have call predecessors, (5628), 84 states have return successors, (5628), 5628 states have call predecessors, (5628), 5628 states have call successors, (5628) [2025-03-04 00:36:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35669 states to 35669 states and 57766 transitions. [2025-03-04 00:36:13,639 INFO L78 Accepts]: Start accepts. Automaton has 35669 states and 57766 transitions. Word has length 464 [2025-03-04 00:36:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:13,639 INFO L471 AbstractCegarLoop]: Abstraction has 35669 states and 57766 transitions. [2025-03-04 00:36:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-04 00:36:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 35669 states and 57766 transitions. [2025-03-04 00:36:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-04 00:36:13,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:13,658 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:13,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:36:13,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 358798570, now seen corresponding path program 1 times [2025-03-04 00:36:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:13,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386877991] [2025-03-04 00:36:13,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:13,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-04 00:36:13,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-04 00:36:13,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:13,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:36:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386877991] [2025-03-04 00:36:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386877991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102616843] [2025-03-04 00:36:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:13,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:13,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:13,917 INFO L87 Difference]: Start difference. First operand 35669 states and 57766 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:36:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:14,898 INFO L93 Difference]: Finished difference Result 85801 states and 139086 transitions. [2025-03-04 00:36:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 464 [2025-03-04 00:36:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:15,085 INFO L225 Difference]: With dead ends: 85801 [2025-03-04 00:36:15,085 INFO L226 Difference]: Without dead ends: 50135 [2025-03-04 00:36:15,169 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-04 00:36:15,171 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 449 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:15,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1449 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:36:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50135 states. [2025-03-04 00:36:17,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50135 to 48455. [2025-03-04 00:36:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48455 states, 40294 states have (on average 1.5360103241177347) internal successors, (61892), 40294 states have internal predecessors, (61892), 8040 states have call successors, (8040), 120 states have call predecessors, (8040), 120 states have return successors, (8040), 8040 states have call predecessors, (8040), 8040 states have call successors, (8040) [2025-03-04 00:36:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48455 states to 48455 states and 77972 transitions. [2025-03-04 00:36:17,775 INFO L78 Accepts]: Start accepts. Automaton has 48455 states and 77972 transitions. Word has length 464 [2025-03-04 00:36:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:17,776 INFO L471 AbstractCegarLoop]: Abstraction has 48455 states and 77972 transitions. [2025-03-04 00:36:17,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:36:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 48455 states and 77972 transitions. [2025-03-04 00:36:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-04 00:36:17,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:17,803 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:17,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:36:17,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash 791238516, now seen corresponding path program 1 times [2025-03-04 00:36:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715267326] [2025-03-04 00:36:17,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:17,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 00:36:18,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 00:36:18,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:18,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:36:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715267326] [2025-03-04 00:36:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715267326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824997221] [2025-03-04 00:36:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:18,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:18,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:18,626 INFO L87 Difference]: Start difference. First operand 48455 states and 77972 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:36:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:20,589 INFO L93 Difference]: Finished difference Result 120589 states and 193559 transitions. [2025-03-04 00:36:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 465 [2025-03-04 00:36:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:20,803 INFO L225 Difference]: With dead ends: 120589 [2025-03-04 00:36:20,803 INFO L226 Difference]: Without dead ends: 72137 [2025-03-04 00:36:20,875 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-04 00:36:20,876 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 880 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:20,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1689 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:36:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72137 states. [2025-03-04 00:36:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72137 to 72073. [2025-03-04 00:36:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72073 states, 60312 states have (on average 1.5305080249369942) internal successors, (92308), 60372 states have internal predecessors, (92308), 11520 states have call successors, (11520), 240 states have call predecessors, (11520), 240 states have return successors, (11520), 11460 states have call predecessors, (11520), 11520 states have call successors, (11520) [2025-03-04 00:36:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72073 states to 72073 states and 115348 transitions. [2025-03-04 00:36:25,220 INFO L78 Accepts]: Start accepts. Automaton has 72073 states and 115348 transitions. Word has length 465 [2025-03-04 00:36:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 72073 states and 115348 transitions. [2025-03-04 00:36:25,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:36:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 72073 states and 115348 transitions. [2025-03-04 00:36:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-04 00:36:25,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:25,252 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:25,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:36:25,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:25,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 628743448, now seen corresponding path program 1 times [2025-03-04 00:36:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:25,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477927279] [2025-03-04 00:36:25,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:25,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:25,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 00:36:27,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 00:36:27,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:27,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-04 00:36:33,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:33,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477927279] [2025-03-04 00:36:33,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477927279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:33,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:33,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:36:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641291447] [2025-03-04 00:36:33,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:33,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:36:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:33,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:36:33,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:36:33,040 INFO L87 Difference]: Start difference. First operand 72073 states and 115348 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:36:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:35,888 INFO L93 Difference]: Finished difference Result 153348 states and 244711 transitions. [2025-03-04 00:36:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:36:35,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 465 [2025-03-04 00:36:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:36,202 INFO L225 Difference]: With dead ends: 153348 [2025-03-04 00:36:36,202 INFO L226 Difference]: Without dead ends: 81278 [2025-03-04 00:36:36,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:36:36,375 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 824 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:36,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1711 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:36:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81278 states. [2025-03-04 00:36:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81278 to 75064. [2025-03-04 00:36:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75064 states, 63303 states have (on average 1.5310332843625105) internal successors, (96919), 63363 states have internal predecessors, (96919), 11520 states have call successors, (11520), 240 states have call predecessors, (11520), 240 states have return successors, (11520), 11460 states have call predecessors, (11520), 11520 states have call successors, (11520) [2025-03-04 00:36:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75064 states to 75064 states and 119959 transitions. [2025-03-04 00:36:40,629 INFO L78 Accepts]: Start accepts. Automaton has 75064 states and 119959 transitions. Word has length 465 [2025-03-04 00:36:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:40,630 INFO L471 AbstractCegarLoop]: Abstraction has 75064 states and 119959 transitions. [2025-03-04 00:36:40,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-04 00:36:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 75064 states and 119959 transitions. [2025-03-04 00:36:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-04 00:36:40,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:40,658 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:36:40,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:36:40,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:40,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2035444820, now seen corresponding path program 1 times [2025-03-04 00:36:40,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:40,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48729206] [2025-03-04 00:36:40,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-04 00:36:41,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-04 00:36:41,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:41,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat