./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b22327eee78d50d1e1892e34431f5123d0f1cfe06d349ebd74106592553c44aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:51:23,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:51:23,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:51:23,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:51:23,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:51:23,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:51:23,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:51:23,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:51:23,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:51:23,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:51:23,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:51:23,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:51:23,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:51:23,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:51:23,805 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:51:23,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:51:23,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:51:23,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:51:23,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:51:23,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:51:23,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:51:23,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:23,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:51:23,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:51:23,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:51:23,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:51:23,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:23,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:51:23,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b22327eee78d50d1e1892e34431f5123d0f1cfe06d349ebd74106592553c44aa [2025-01-09 14:51:24,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:51:24,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:51:24,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:51:24,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:51:24,046 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:51:24,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i [2025-01-09 14:51:25,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0653d5629/887ff367db8045af8ed445cb06626183/FLAG44019d25e [2025-01-09 14:51:25,425 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:51:25,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i [2025-01-09 14:51:25,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0653d5629/887ff367db8045af8ed445cb06626183/FLAG44019d25e [2025-01-09 14:51:25,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0653d5629/887ff367db8045af8ed445cb06626183 [2025-01-09 14:51:25,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:51:25,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:51:25,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:51:25,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:51:25,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:51:25,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:25,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3528870c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25, skipping insertion in model container [2025-01-09 14:51:25,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:25,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:51:25,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i[916,929] [2025-01-09 14:51:25,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:51:25,756 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:51:25,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-86.i[916,929] [2025-01-09 14:51:25,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:51:25,874 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:51:25,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25 WrapperNode [2025-01-09 14:51:25,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:51:25,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:51:25,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:51:25,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:51:25,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:25,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:25,970 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 711 [2025-01-09 14:51:25,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:51:25,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:51:25,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:51:25,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:51:25,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:25,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:25,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,061 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:51:26,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:51:26,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:51:26,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:51:26,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:51:26,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (1/1) ... [2025-01-09 14:51:26,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:26,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:26,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:51:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:51:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:51:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:51:26,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:51:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:51:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:51:26,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:51:26,280 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:51:26,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:51:27,153 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-01-09 14:51:27,154 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:51:27,170 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:51:27,170 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:51:27,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:27 BoogieIcfgContainer [2025-01-09 14:51:27,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:51:27,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:51:27,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:51:27,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:51:27,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:51:25" (1/3) ... [2025-01-09 14:51:27,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac067f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:27, skipping insertion in model container [2025-01-09 14:51:27,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:25" (2/3) ... [2025-01-09 14:51:27,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac067f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:27, skipping insertion in model container [2025-01-09 14:51:27,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:27" (3/3) ... [2025-01-09 14:51:27,179 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-86.i [2025-01-09 14:51:27,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:51:27,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-86.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:51:27,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:51:27,250 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;@31641c24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:51:27,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:51:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 214 states have (on average 1.5560747663551402) internal successors, (333), 215 states have internal predecessors, (333), 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-01-09 14:51:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-01-09 14:51:27,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:27,276 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, 1] [2025-01-09 14:51:27,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:27,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 278957294, now seen corresponding path program 1 times [2025-01-09 14:51:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:27,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455185638] [2025-01-09 14:51:27,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:27,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-01-09 14:51:27,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-01-09 14:51:27,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:27,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455185638] [2025-01-09 14:51:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455185638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:51:27,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016536265] [2025-01-09 14:51:27,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:27,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:51:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:27,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:51:27,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:51:27,890 INFO L87 Difference]: Start difference. First operand has 284 states, 214 states have (on average 1.5560747663551402) internal successors, (333), 215 states have internal predecessors, (333), 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 67.0) internal successors, (134), 2 states have internal predecessors, (134), 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-01-09 14:51:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:27,945 INFO L93 Difference]: Finished difference Result 562 states and 996 transitions. [2025-01-09 14:51:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:51:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 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 466 [2025-01-09 14:51:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:27,957 INFO L225 Difference]: With dead ends: 562 [2025-01-09 14:51:27,957 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 14:51:27,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:51:27,962 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:27,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 14:51:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-01-09 14:51:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 212 states have (on average 1.528301886792453) internal successors, (324), 212 states have internal predecessors, (324), 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-01-09 14:51:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 458 transitions. [2025-01-09 14:51:28,016 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 458 transitions. Word has length 466 [2025-01-09 14:51:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:28,017 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 458 transitions. [2025-01-09 14:51:28,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 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-01-09 14:51:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 458 transitions. [2025-01-09 14:51:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:28,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:28,038 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, 1, 1, 1] [2025-01-09 14:51:28,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:51:28,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:28,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1094288342, now seen corresponding path program 1 times [2025-01-09 14:51:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80178381] [2025-01-09 14:51:28,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:28,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:28,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:28,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:28,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80178381] [2025-01-09 14:51:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80178381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:28,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457037876] [2025-01-09 14:51:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:28,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:28,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:28,524 INFO L87 Difference]: Start difference. First operand 281 states and 458 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:28,658 INFO L93 Difference]: Finished difference Result 819 states and 1334 transitions. [2025-01-09 14:51:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:28,665 INFO L225 Difference]: With dead ends: 819 [2025-01-09 14:51:28,667 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 14:51:28,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:28,668 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 400 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:28,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1070 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 14:51:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 354. [2025-01-09 14:51:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 285 states have (on average 1.5719298245614035) internal successors, (448), 285 states have internal predecessors, (448), 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-01-09 14:51:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 582 transitions. [2025-01-09 14:51:28,717 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 582 transitions. Word has length 468 [2025-01-09 14:51:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:28,718 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 582 transitions. [2025-01-09 14:51:28,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 582 transitions. [2025-01-09 14:51:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:28,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:28,725 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, 1, 1, 1] [2025-01-09 14:51:28,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:51:28,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 675635418, now seen corresponding path program 1 times [2025-01-09 14:51:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377401293] [2025-01-09 14:51:28,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:28,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:28,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:28,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:28,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:28,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377401293] [2025-01-09 14:51:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377401293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055218486] [2025-01-09 14:51:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:29,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:29,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:29,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:29,132 INFO L87 Difference]: Start difference. First operand 354 states and 582 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:29,247 INFO L93 Difference]: Finished difference Result 1040 states and 1712 transitions. [2025-01-09 14:51:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:29,253 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 14:51:29,253 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 14:51:29,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:29,255 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 410 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:29,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1204 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 14:51:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 687. [2025-01-09 14:51:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 550 states have (on average 1.5581818181818181) internal successors, (857), 550 states have internal predecessors, (857), 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-01-09 14:51:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1125 transitions. [2025-01-09 14:51:29,316 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1125 transitions. Word has length 468 [2025-01-09 14:51:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:29,317 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1125 transitions. [2025-01-09 14:51:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:29,317 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1125 transitions. [2025-01-09 14:51:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:29,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:29,323 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, 1, 1, 1] [2025-01-09 14:51:29,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:51:29,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:29,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 183009244, now seen corresponding path program 1 times [2025-01-09 14:51:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348878234] [2025-01-09 14:51:29,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:29,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:29,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:29,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:29,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348878234] [2025-01-09 14:51:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348878234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438754828] [2025-01-09 14:51:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:29,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:29,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:29,994 INFO L87 Difference]: Start difference. First operand 687 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-01-09 14:51:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:30,328 INFO L93 Difference]: Finished difference Result 1909 states and 3132 transitions. [2025-01-09 14:51:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:30,337 INFO L225 Difference]: With dead ends: 1909 [2025-01-09 14:51:30,338 INFO L226 Difference]: Without dead ends: 1225 [2025-01-09 14:51:30,340 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-01-09 14:51:30,341 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 327 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:30,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1331 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-01-09 14:51:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 810. [2025-01-09 14:51:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 605 states have (on average 1.51900826446281) internal successors, (919), 605 states have internal predecessors, (919), 201 states have call successors, (201), 3 states have call predecessors, (201), 3 states have return successors, (201), 201 states have call predecessors, (201), 201 states have call successors, (201) [2025-01-09 14:51:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1321 transitions. [2025-01-09 14:51:30,433 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1321 transitions. Word has length 468 [2025-01-09 14:51:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:30,433 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1321 transitions. [2025-01-09 14:51:30,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-01-09 14:51:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1321 transitions. [2025-01-09 14:51:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:30,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:30,439 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, 1, 1, 1] [2025-01-09 14:51:30,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:51:30,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -510496228, now seen corresponding path program 1 times [2025-01-09 14:51:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691987861] [2025-01-09 14:51:30,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:30,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:30,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:30,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:30,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691987861] [2025-01-09 14:51:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691987861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43875086] [2025-01-09 14:51:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:31,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:31,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:31,155 INFO L87 Difference]: Start difference. First operand 810 states and 1321 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-01-09 14:51:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:31,384 INFO L93 Difference]: Finished difference Result 2193 states and 3565 transitions. [2025-01-09 14:51:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:31,393 INFO L225 Difference]: With dead ends: 2193 [2025-01-09 14:51:31,393 INFO L226 Difference]: Without dead ends: 1509 [2025-01-09 14:51:31,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 14:51:31,395 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 765 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:31,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1126 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:51:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-01-09 14:51:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1312. [2025-01-09 14:51:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1072 states have (on average 1.5634328358208955) internal successors, (1676), 1074 states have internal predecessors, (1676), 233 states have call successors, (233), 6 states have call predecessors, (233), 6 states have return successors, (233), 231 states have call predecessors, (233), 233 states have call successors, (233) [2025-01-09 14:51:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2142 transitions. [2025-01-09 14:51:31,471 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2142 transitions. Word has length 468 [2025-01-09 14:51:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:31,472 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 2142 transitions. [2025-01-09 14:51:31,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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-01-09 14:51:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2142 transitions. [2025-01-09 14:51:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:31,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:31,477 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, 1, 1, 1] [2025-01-09 14:51:31,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:51:31,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash -927892834, now seen corresponding path program 1 times [2025-01-09 14:51:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:31,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390486769] [2025-01-09 14:51:31,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:31,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:31,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:31,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:31,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:31,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:34,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:34,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390486769] [2025-01-09 14:51:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390486769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661629490] [2025-01-09 14:51:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:34,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:34,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:34,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:34,417 INFO L87 Difference]: Start difference. First operand 1312 states and 2142 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-01-09 14:51:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:35,080 INFO L93 Difference]: Finished difference Result 3240 states and 5283 transitions. [2025-01-09 14:51:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:51:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:35,092 INFO L225 Difference]: With dead ends: 3240 [2025-01-09 14:51:35,093 INFO L226 Difference]: Without dead ends: 2060 [2025-01-09 14:51:35,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:51:35,097 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 651 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:35,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1051 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:51:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2025-01-09 14:51:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1348. [2025-01-09 14:51:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1103 states have (on average 1.5475974614687216) internal successors, (1707), 1105 states have internal predecessors, (1707), 233 states have call successors, (233), 11 states have call predecessors, (233), 11 states have return successors, (233), 231 states have call predecessors, (233), 233 states have call successors, (233) [2025-01-09 14:51:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2173 transitions. [2025-01-09 14:51:35,169 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2173 transitions. Word has length 468 [2025-01-09 14:51:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:35,169 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2173 transitions. [2025-01-09 14:51:35,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-01-09 14:51:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2173 transitions. [2025-01-09 14:51:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:35,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:35,173 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, 1, 1, 1] [2025-01-09 14:51:35,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:51:35,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -367193056, now seen corresponding path program 1 times [2025-01-09 14:51:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566490793] [2025-01-09 14:51:35,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:35,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:35,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:45,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566490793] [2025-01-09 14:51:45,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566490793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:45,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:51:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574749458] [2025-01-09 14:51:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:45,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:51:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:45,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:51:45,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:51:45,127 INFO L87 Difference]: Start difference. First operand 1348 states and 2173 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-01-09 14:51:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:48,322 INFO L93 Difference]: Finished difference Result 4192 states and 6773 transitions. [2025-01-09 14:51:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:51:48,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 468 [2025-01-09 14:51:48,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:48,334 INFO L225 Difference]: With dead ends: 4192 [2025-01-09 14:51:48,334 INFO L226 Difference]: Without dead ends: 2980 [2025-01-09 14:51:48,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:51:48,339 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1431 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:48,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 2149 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:51:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2025-01-09 14:51:48,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2884. [2025-01-09 14:51:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2606 states have (on average 1.594781273983116) internal successors, (4156), 2612 states have internal predecessors, (4156), 257 states have call successors, (257), 20 states have call predecessors, (257), 20 states have return successors, (257), 251 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 14:51:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4670 transitions. [2025-01-09 14:51:48,444 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4670 transitions. Word has length 468 [2025-01-09 14:51:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:48,445 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4670 transitions. [2025-01-09 14:51:48,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-01-09 14:51:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4670 transitions. [2025-01-09 14:51:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:48,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:48,451 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, 1, 1, 1] [2025-01-09 14:51:48,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:51:48,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:48,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:48,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1033681824, now seen corresponding path program 1 times [2025-01-09 14:51:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667867166] [2025-01-09 14:51:48,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:48,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:48,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:48,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:48,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667867166] [2025-01-09 14:51:49,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667867166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:49,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:49,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:51:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39264085] [2025-01-09 14:51:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:51:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:49,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:51:49,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:51:49,287 INFO L87 Difference]: Start difference. First operand 2884 states and 4670 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-09 14:51:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:50,180 INFO L93 Difference]: Finished difference Result 12218 states and 19724 transitions. [2025-01-09 14:51:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:51:50,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:50,215 INFO L225 Difference]: With dead ends: 12218 [2025-01-09 14:51:50,215 INFO L226 Difference]: Without dead ends: 9474 [2025-01-09 14:51:50,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:51:50,225 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 2242 mSDsluCounter, 2845 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2242 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:50,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2242 Valid, 3645 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:51:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9474 states. [2025-01-09 14:51:50,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9474 to 5429. [2025-01-09 14:51:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5429 states, 5151 states have (on average 1.6394874781595807) internal successors, (8445), 5157 states have internal predecessors, (8445), 257 states have call successors, (257), 20 states have call predecessors, (257), 20 states have return successors, (257), 251 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 14:51:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5429 states to 5429 states and 8959 transitions. [2025-01-09 14:51:50,420 INFO L78 Accepts]: Start accepts. Automaton has 5429 states and 8959 transitions. Word has length 468 [2025-01-09 14:51:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 5429 states and 8959 transitions. [2025-01-09 14:51:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-09 14:51:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5429 states and 8959 transitions. [2025-01-09 14:51:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:50,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:50,431 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, 1, 1, 1] [2025-01-09 14:51:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:51:50,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1060747426, now seen corresponding path program 1 times [2025-01-09 14:51:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405926885] [2025-01-09 14:51:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:50,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:50,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:50,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:50,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405926885] [2025-01-09 14:51:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405926885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:50,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:50,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322464205] [2025-01-09 14:51:50,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:50,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:50,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:50,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:50,584 INFO L87 Difference]: Start difference. First operand 5429 states and 8959 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:50,716 INFO L93 Difference]: Finished difference Result 15731 states and 25975 transitions. [2025-01-09 14:51:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:50,754 INFO L225 Difference]: With dead ends: 15731 [2025-01-09 14:51:50,754 INFO L226 Difference]: Without dead ends: 10442 [2025-01-09 14:51:50,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:50,766 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 429 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:50,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1109 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:50,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10442 states. [2025-01-09 14:51:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10442 to 5709. [2025-01-09 14:51:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 5431 states have (on average 1.6098324433805928) internal successors, (8743), 5437 states have internal predecessors, (8743), 257 states have call successors, (257), 20 states have call predecessors, (257), 20 states have return successors, (257), 251 states have call predecessors, (257), 257 states have call successors, (257) [2025-01-09 14:51:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 9257 transitions. [2025-01-09 14:51:50,955 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 9257 transitions. Word has length 468 [2025-01-09 14:51:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:50,955 INFO L471 AbstractCegarLoop]: Abstraction has 5709 states and 9257 transitions. [2025-01-09 14:51:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 9257 transitions. [2025-01-09 14:51:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:50,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:50,965 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, 1, 1, 1] [2025-01-09 14:51:50,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:51:50,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:50,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1936429278, now seen corresponding path program 1 times [2025-01-09 14:51:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:50,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965593297] [2025-01-09 14:51:50,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:50,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:51,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:51,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:51,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:51,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:51,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965593297] [2025-01-09 14:51:51,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965593297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:51,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:51,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517946096] [2025-01-09 14:51:51,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:51,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:51,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:51,115 INFO L87 Difference]: Start difference. First operand 5709 states and 9257 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:51,283 INFO L93 Difference]: Finished difference Result 14267 states and 23102 transitions. [2025-01-09 14:51:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:51,300 INFO L225 Difference]: With dead ends: 14267 [2025-01-09 14:51:51,301 INFO L226 Difference]: Without dead ends: 8698 [2025-01-09 14:51:51,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:51,309 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 238 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:51,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 987 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8698 states. [2025-01-09 14:51:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8698 to 8692. [2025-01-09 14:51:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8692 states, 8317 states have (on average 1.6044246723578213) internal successors, (13344), 8331 states have internal predecessors, (13344), 337 states have call successors, (337), 37 states have call predecessors, (337), 37 states have return successors, (337), 323 states have call predecessors, (337), 337 states have call successors, (337) [2025-01-09 14:51:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8692 states to 8692 states and 14018 transitions. [2025-01-09 14:51:51,514 INFO L78 Accepts]: Start accepts. Automaton has 8692 states and 14018 transitions. Word has length 468 [2025-01-09 14:51:51,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:51,515 INFO L471 AbstractCegarLoop]: Abstraction has 8692 states and 14018 transitions. [2025-01-09 14:51:51,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8692 states and 14018 transitions. [2025-01-09 14:51:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-01-09 14:51:51,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:51,528 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, 1, 1, 1] [2025-01-09 14:51:51,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:51:51,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:51,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2008815836, now seen corresponding path program 1 times [2025-01-09 14:51:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:51,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551891022] [2025-01-09 14:51:51,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:51,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:51,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-01-09 14:51:51,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-01-09 14:51:51,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:51,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551891022] [2025-01-09 14:51:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551891022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059505551] [2025-01-09 14:51:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:51,974 INFO L87 Difference]: Start difference. First operand 8692 states and 14018 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:52,230 INFO L93 Difference]: Finished difference Result 23356 states and 37610 transitions. [2025-01-09 14:51:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:52,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 468 [2025-01-09 14:51:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:52,264 INFO L225 Difference]: With dead ends: 23356 [2025-01-09 14:51:52,264 INFO L226 Difference]: Without dead ends: 14808 [2025-01-09 14:51:52,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:52,283 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 326 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:52,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1121 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14808 states. [2025-01-09 14:51:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14808 to 14794. [2025-01-09 14:51:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14794 states, 14117 states have (on average 1.593185521003046) internal successors, (22491), 14145 states have internal predecessors, (22491), 607 states have call successors, (607), 69 states have call predecessors, (607), 69 states have return successors, (607), 579 states have call predecessors, (607), 607 states have call successors, (607) [2025-01-09 14:51:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14794 states to 14794 states and 23705 transitions. [2025-01-09 14:51:52,729 INFO L78 Accepts]: Start accepts. Automaton has 14794 states and 23705 transitions. Word has length 468 [2025-01-09 14:51:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 14794 states and 23705 transitions. [2025-01-09 14:51:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-01-09 14:51:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14794 states and 23705 transitions. [2025-01-09 14:51:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 14:51:52,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:52,749 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, 1, 1, 1, 1] [2025-01-09 14:51:52,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:51:52,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:52,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1800039391, now seen corresponding path program 1 times [2025-01-09 14:51:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:52,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299221803] [2025-01-09 14:51:52,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:52,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:52,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 14:51:53,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 14:51:53,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:53,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:53,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:53,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299221803] [2025-01-09 14:51:53,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299221803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:53,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:53,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:53,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969746682] [2025-01-09 14:51:53,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:53,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:53,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:53,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:53,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:53,801 INFO L87 Difference]: Start difference. First operand 14794 states and 23705 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-09 14:51:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:54,394 INFO L93 Difference]: Finished difference Result 37464 states and 59958 transitions. [2025-01-09 14:51:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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 469 [2025-01-09 14:51:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:54,441 INFO L225 Difference]: With dead ends: 37464 [2025-01-09 14:51:54,442 INFO L226 Difference]: Without dead ends: 22574 [2025-01-09 14:51:54,456 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-01-09 14:51:54,456 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 556 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:54,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1346 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:51:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2025-01-09 14:51:54,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 18558. [2025-01-09 14:51:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18558 states, 17881 states have (on average 1.601308651641407) internal successors, (28633), 17909 states have internal predecessors, (28633), 607 states have call successors, (607), 69 states have call predecessors, (607), 69 states have return successors, (607), 579 states have call predecessors, (607), 607 states have call successors, (607) [2025-01-09 14:51:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18558 states to 18558 states and 29847 transitions. [2025-01-09 14:51:54,991 INFO L78 Accepts]: Start accepts. Automaton has 18558 states and 29847 transitions. Word has length 469 [2025-01-09 14:51:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:54,992 INFO L471 AbstractCegarLoop]: Abstraction has 18558 states and 29847 transitions. [2025-01-09 14:51:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-09 14:51:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18558 states and 29847 transitions. [2025-01-09 14:51:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 14:51:55,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:55,013 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, 1, 1, 1, 1] [2025-01-09 14:51:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:51:55,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash 320732620, now seen corresponding path program 1 times [2025-01-09 14:51:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648937291] [2025-01-09 14:51:55,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:55,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 14:51:55,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 14:51:55,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:55,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:55,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648937291] [2025-01-09 14:51:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648937291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052110535] [2025-01-09 14:51:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:55,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:55,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:55,850 INFO L87 Difference]: Start difference. First operand 18558 states and 29847 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-01-09 14:51:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:56,968 INFO L93 Difference]: Finished difference Result 51067 states and 81603 transitions. [2025-01-09 14:51:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:56,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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 469 [2025-01-09 14:51:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:57,032 INFO L225 Difference]: With dead ends: 51067 [2025-01-09 14:51:57,032 INFO L226 Difference]: Without dead ends: 31696 [2025-01-09 14:51:57,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:51:57,056 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 920 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:57,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1947 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:51:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31696 states. [2025-01-09 14:51:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31696 to 22893. [2025-01-09 14:51:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22893 states, 22216 states have (on average 1.594481454807346) internal successors, (35423), 22244 states have internal predecessors, (35423), 607 states have call successors, (607), 69 states have call predecessors, (607), 69 states have return successors, (607), 579 states have call predecessors, (607), 607 states have call successors, (607) [2025-01-09 14:51:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22893 states to 22893 states and 36637 transitions. [2025-01-09 14:51:57,725 INFO L78 Accepts]: Start accepts. Automaton has 22893 states and 36637 transitions. Word has length 469 [2025-01-09 14:51:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 22893 states and 36637 transitions. [2025-01-09 14:51:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-01-09 14:51:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22893 states and 36637 transitions. [2025-01-09 14:51:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 14:51:57,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:57,747 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, 1, 1, 1, 1] [2025-01-09 14:51:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:51:57,747 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:57,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2044004996, now seen corresponding path program 1 times [2025-01-09 14:51:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:57,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513938042] [2025-01-09 14:51:57,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:57,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 14:51:57,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 14:51:57,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:51:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513938042] [2025-01-09 14:51:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513938042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153612729] [2025-01-09 14:51:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:58,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:58,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:58,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:58,246 INFO L87 Difference]: Start difference. First operand 22893 states and 36637 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-01-09 14:51:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:59,054 INFO L93 Difference]: Finished difference Result 56541 states and 90170 transitions. [2025-01-09 14:51:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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 469 [2025-01-09 14:51:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:59,106 INFO L225 Difference]: With dead ends: 56541 [2025-01-09 14:51:59,107 INFO L226 Difference]: Without dead ends: 33696 [2025-01-09 14:51:59,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:59,129 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 1078 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:59,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1478 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:51:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33696 states. [2025-01-09 14:51:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33696 to 23438. [2025-01-09 14:51:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23438 states, 22761 states have (on average 1.5861781116822635) internal successors, (36103), 22789 states have internal predecessors, (36103), 607 states have call successors, (607), 69 states have call predecessors, (607), 69 states have return successors, (607), 579 states have call predecessors, (607), 607 states have call successors, (607) [2025-01-09 14:51:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23438 states to 23438 states and 37317 transitions. [2025-01-09 14:51:59,679 INFO L78 Accepts]: Start accepts. Automaton has 23438 states and 37317 transitions. Word has length 469 [2025-01-09 14:51:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:59,679 INFO L471 AbstractCegarLoop]: Abstraction has 23438 states and 37317 transitions. [2025-01-09 14:51:59,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 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-01-09 14:51:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 23438 states and 37317 transitions. [2025-01-09 14:51:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 14:51:59,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:59,697 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, 1, 1, 1, 1] [2025-01-09 14:51:59,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:51:59,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:59,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash -201574458, now seen corresponding path program 1 times [2025-01-09 14:51:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247331558] [2025-01-09 14:51:59,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 14:52:00,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 14:52:00,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:00,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:52:02,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:02,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247331558] [2025-01-09 14:52:02,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247331558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:02,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:02,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 14:52:02,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26360348] [2025-01-09 14:52:02,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:02,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:52:02,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:02,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:52:02,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:52:02,435 INFO L87 Difference]: Start difference. First operand 23438 states and 37317 transitions. Second operand has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 5 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 5 states have call predecessors, (67), 5 states have call successors, (67) [2025-01-09 14:52:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:08,399 INFO L93 Difference]: Finished difference Result 73937 states and 117500 transitions. [2025-01-09 14:52:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:52:08,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 5 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 5 states have call predecessors, (67), 5 states have call successors, (67) Word has length 469 [2025-01-09 14:52:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:08,465 INFO L225 Difference]: With dead ends: 73937 [2025-01-09 14:52:08,465 INFO L226 Difference]: Without dead ends: 50643 [2025-01-09 14:52:08,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:52:08,492 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 5390 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5390 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 4634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:08,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5390 Valid, 3906 Invalid, 4634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 14:52:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50643 states. [2025-01-09 14:52:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50643 to 29961. [2025-01-09 14:52:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29961 states, 29157 states have (on average 1.5829474911685015) internal successors, (46154), 29195 states have internal predecessors, (46154), 687 states have call successors, (687), 116 states have call predecessors, (687), 116 states have return successors, (687), 649 states have call predecessors, (687), 687 states have call successors, (687) [2025-01-09 14:52:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29961 states to 29961 states and 47528 transitions. [2025-01-09 14:52:09,186 INFO L78 Accepts]: Start accepts. Automaton has 29961 states and 47528 transitions. Word has length 469 [2025-01-09 14:52:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:09,187 INFO L471 AbstractCegarLoop]: Abstraction has 29961 states and 47528 transitions. [2025-01-09 14:52:09,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.611111111111111) internal successors, (137), 18 states have internal predecessors, (137), 5 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 5 states have call predecessors, (67), 5 states have call successors, (67) [2025-01-09 14:52:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29961 states and 47528 transitions. [2025-01-09 14:52:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-01-09 14:52:09,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:09,209 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, 1, 1, 1, 1] [2025-01-09 14:52:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:52:09,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:09,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1462491708, now seen corresponding path program 1 times [2025-01-09 14:52:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394716641] [2025-01-09 14:52:09,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:09,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-01-09 14:52:10,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-01-09 14:52:10,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:10,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:52:27,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:27,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394716641] [2025-01-09 14:52:27,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394716641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:27,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-01-09 14:52:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300258721] [2025-01-09 14:52:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:27,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 14:52:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:27,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 14:52:27,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:52:27,907 INFO L87 Difference]: Start difference. First operand 29961 states and 47528 transitions. Second operand has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 31 states have internal predecessors, (137), 9 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 9 states have call predecessors, (67), 9 states have call successors, (67)