./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 355322de5dcfb8cbd44ad690b6b14768d5a2fa38ff5dfd1ede94c260e278eb8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:05:17,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:05:17,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:05:17,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:05:17,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:05:17,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:05:17,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:05:17,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:05:17,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:05:17,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:05:17,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:05:17,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:05:17,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:05:17,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:05:17,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:05:17,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:05:17,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:05:17,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:05:17,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:05:17,794 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 355322de5dcfb8cbd44ad690b6b14768d5a2fa38ff5dfd1ede94c260e278eb8b [2025-03-03 16:05:18,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:05:18,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:05:18,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:05:18,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:05:18,010 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:05:18,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2025-03-03 16:05:19,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c45ed2a0/d8acb2bfa0f04190a487ea4eaa3d23dd/FLAG6fa046e4d [2025-03-03 16:05:19,640 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:05:19,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2025-03-03 16:05:19,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c45ed2a0/d8acb2bfa0f04190a487ea4eaa3d23dd/FLAG6fa046e4d [2025-03-03 16:05:19,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c45ed2a0/d8acb2bfa0f04190a487ea4eaa3d23dd [2025-03-03 16:05:19,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:05:19,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:05:19,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:05:19,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:05:19,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:05:19,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:05:19" (1/1) ... [2025-03-03 16:05:19,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e8db609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:19, skipping insertion in model container [2025-03-03 16:05:19,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:05:19" (1/1) ... [2025-03-03 16:05:19,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:05:20,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[8616,8629] [2025-03-03 16:05:20,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[10953,10966] [2025-03-03 16:05:20,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:05:20,588 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:05:20,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[8616,8629] [2025-03-03 16:05:20,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c[10953,10966] [2025-03-03 16:05:20,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:05:20,894 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:05:20,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20 WrapperNode [2025-03-03 16:05:20,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:05:20,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:05:20,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:05:20,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:05:20,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:20,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,238 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5033 [2025-03-03 16:05:21,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:05:21,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:05:21,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:05:21,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:05:21,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,425 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:05:21,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:05:21,646 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:05:21,647 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:05:21,647 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:05:21,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (1/1) ... [2025-03-03 16:05:21,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:05:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:21,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:05:21,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:05:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:05:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:05:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:05:21,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:05:21,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:05:21,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:05:25,040 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5020: havoc calculate_output3_#t~ret36#1; [2025-03-03 16:05:25,041 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: havoc calculate_output_#t~ret34#1; [2025-03-03 16:05:25,041 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3530: havoc calculate_output2_#t~ret35#1; [2025-03-03 16:05:25,159 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-03-03 16:05:25,159 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:05:25,185 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:05:25,185 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:05:25,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:05:25 BoogieIcfgContainer [2025-03-03 16:05:25,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:05:25,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:05:25,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:05:25,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:05:25,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:05:19" (1/3) ... [2025-03-03 16:05:25,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24219e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:05:25, skipping insertion in model container [2025-03-03 16:05:25,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:05:20" (2/3) ... [2025-03-03 16:05:25,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24219e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:05:25, skipping insertion in model container [2025-03-03 16:05:25,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:05:25" (3/3) ... [2025-03-03 16:05:25,196 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c [2025-03-03 16:05:25,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:05:25,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label03.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:05:25,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:05:25,278 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;@2fb4efc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:05:25,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:05:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 16:05:25,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:25,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:25,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:25,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1594307206, now seen corresponding path program 1 times [2025-03-03 16:05:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:25,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029295818] [2025-03-03 16:05:25,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:25,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:25,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 16:05:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 16:05:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:25,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:25,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:25,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029295818] [2025-03-03 16:05:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029295818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:25,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:05:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435631236] [2025-03-03 16:05:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:25,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:25,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:25,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:25,525 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:28,311 INFO L93 Difference]: Finished difference Result 2494 states and 4803 transitions. [2025-03-03 16:05:28,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 16:05:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:28,332 INFO L225 Difference]: With dead ends: 2494 [2025-03-03 16:05:28,334 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 16:05:28,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:28,343 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 989 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:28,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 269 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 16:05:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 16:05:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2025-03-03 16:05:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1568 states have (on average 1.8411989795918366) internal successors, (2887), 1569 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2887 transitions. [2025-03-03 16:05:28,456 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2887 transitions. Word has length 20 [2025-03-03 16:05:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:28,456 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2887 transitions. [2025-03-03 16:05:28,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2887 transitions. [2025-03-03 16:05:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:05:28,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:28,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:05:28,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:28,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1147455281, now seen corresponding path program 1 times [2025-03-03 16:05:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:28,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482278969] [2025-03-03 16:05:28,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:28,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:28,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:05:28,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:05:28,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:28,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482278969] [2025-03-03 16:05:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482278969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:05:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722031788] [2025-03-03 16:05:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:05:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:28,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:05:28,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:28,608 INFO L87 Difference]: Start difference. First operand 1570 states and 2887 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:28,663 INFO L93 Difference]: Finished difference Result 1646 states and 3005 transitions. [2025-03-03 16:05:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:05:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-03 16:05:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:28,669 INFO L225 Difference]: With dead ends: 1646 [2025-03-03 16:05:28,669 INFO L226 Difference]: Without dead ends: 1606 [2025-03-03 16:05:28,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:28,670 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:28,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-03 16:05:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1570. [2025-03-03 16:05:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1568 states have (on average 1.8265306122448979) internal successors, (2864), 1569 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2864 transitions. [2025-03-03 16:05:28,699 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2864 transitions. Word has length 22 [2025-03-03 16:05:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:28,700 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2864 transitions. [2025-03-03 16:05:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2864 transitions. [2025-03-03 16:05:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:05:28,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:28,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:28,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:05:28,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:28,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:28,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1619243067, now seen corresponding path program 1 times [2025-03-03 16:05:28,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:28,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532625509] [2025-03-03 16:05:28,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:28,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:28,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:05:28,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:05:28,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:28,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532625509] [2025-03-03 16:05:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532625509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:28,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:28,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754575927] [2025-03-03 16:05:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:28,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:28,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:28,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:28,831 INFO L87 Difference]: Start difference. First operand 1570 states and 2864 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:28,960 INFO L93 Difference]: Finished difference Result 1858 states and 3320 transitions. [2025-03-03 16:05:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:05:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-03 16:05:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:28,966 INFO L225 Difference]: With dead ends: 1858 [2025-03-03 16:05:28,966 INFO L226 Difference]: Without dead ends: 1822 [2025-03-03 16:05:28,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:05:28,967 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:28,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:05:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2025-03-03 16:05:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1604. [2025-03-03 16:05:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 1.8214731585518102) internal successors, (2918), 1603 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2918 transitions. [2025-03-03 16:05:28,991 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2918 transitions. Word has length 44 [2025-03-03 16:05:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:28,991 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2918 transitions. [2025-03-03 16:05:28,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2918 transitions. [2025-03-03 16:05:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:05:28,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:28,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:05:28,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1860187818, now seen corresponding path program 1 times [2025-03-03 16:05:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342691461] [2025-03-03 16:05:28,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:28,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:05:29,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:05:29,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:29,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:29,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:29,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342691461] [2025-03-03 16:05:29,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342691461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:29,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:29,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998778842] [2025-03-03 16:05:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:29,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:29,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:29,075 INFO L87 Difference]: Start difference. First operand 1604 states and 2918 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:29,098 INFO L93 Difference]: Finished difference Result 1733 states and 3121 transitions. [2025-03-03 16:05:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-03 16:05:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:29,103 INFO L225 Difference]: With dead ends: 1733 [2025-03-03 16:05:29,103 INFO L226 Difference]: Without dead ends: 1663 [2025-03-03 16:05:29,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:29,104 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-03 16:05:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1661. [2025-03-03 16:05:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1659 states have (on average 1.8119349005424954) internal successors, (3006), 1660 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3006 transitions. [2025-03-03 16:05:29,127 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3006 transitions. Word has length 46 [2025-03-03 16:05:29,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:29,127 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 3006 transitions. [2025-03-03 16:05:29,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3006 transitions. [2025-03-03 16:05:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:05:29,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:29,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:29,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:05:29,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:29,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1827864583, now seen corresponding path program 1 times [2025-03-03 16:05:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356470872] [2025-03-03 16:05:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:29,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:05:29,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:05:29,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:29,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:29,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356470872] [2025-03-03 16:05:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356470872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999373450] [2025-03-03 16:05:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:29,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:29,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:29,343 INFO L87 Difference]: Start difference. First operand 1661 states and 3006 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:29,431 INFO L93 Difference]: Finished difference Result 1790 states and 3206 transitions. [2025-03-03 16:05:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-03-03 16:05:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:29,436 INFO L225 Difference]: With dead ends: 1790 [2025-03-03 16:05:29,436 INFO L226 Difference]: Without dead ends: 1663 [2025-03-03 16:05:29,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:05:29,437 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 1490 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:29,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1733 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-03-03 16:05:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1661. [2025-03-03 16:05:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1659 states have (on average 1.8107293550331525) internal successors, (3004), 1660 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3004 transitions. [2025-03-03 16:05:29,459 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3004 transitions. Word has length 46 [2025-03-03 16:05:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 3004 transitions. [2025-03-03 16:05:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3004 transitions. [2025-03-03 16:05:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 16:05:29,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:29,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:29,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:05:29,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:29,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:29,461 INFO L85 PathProgramCache]: Analyzing trace with hash -798689491, now seen corresponding path program 1 times [2025-03-03 16:05:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906520547] [2025-03-03 16:05:29,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:29,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 16:05:29,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 16:05:29,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906520547] [2025-03-03 16:05:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906520547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:05:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528033155] [2025-03-03 16:05:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:29,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:05:29,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:29,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:05:29,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:29,680 INFO L87 Difference]: Start difference. First operand 1661 states and 3004 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:29,774 INFO L93 Difference]: Finished difference Result 1669 states and 3013 transitions. [2025-03-03 16:05:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:05:29,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-03 16:05:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:29,783 INFO L225 Difference]: With dead ends: 1669 [2025-03-03 16:05:29,783 INFO L226 Difference]: Without dead ends: 1667 [2025-03-03 16:05:29,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:05:29,785 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:29,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-03-03 16:05:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1667. [2025-03-03 16:05:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.8072072072072072) internal successors, (3009), 1666 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3009 transitions. [2025-03-03 16:05:29,839 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3009 transitions. Word has length 47 [2025-03-03 16:05:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3009 transitions. [2025-03-03 16:05:29,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3009 transitions. [2025-03-03 16:05:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:29,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:29,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:29,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:05:29,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash -583055145, now seen corresponding path program 1 times [2025-03-03 16:05:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248981286] [2025-03-03 16:05:29,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:29,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:29,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:29,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:29,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:29,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:29,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248981286] [2025-03-03 16:05:29,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248981286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:29,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:29,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:29,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273755092] [2025-03-03 16:05:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:29,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:29,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:29,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:29,896 INFO L87 Difference]: Start difference. First operand 1667 states and 3009 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:29,919 INFO L93 Difference]: Finished difference Result 1813 states and 3230 transitions. [2025-03-03 16:05:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:29,924 INFO L225 Difference]: With dead ends: 1813 [2025-03-03 16:05:29,925 INFO L226 Difference]: Without dead ends: 1737 [2025-03-03 16:05:29,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:29,926 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:29,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:29,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-03-03 16:05:29,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1735. [2025-03-03 16:05:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1733 states have (on average 1.7945758799769187) internal successors, (3110), 1734 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 3110 transitions. [2025-03-03 16:05:29,953 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 3110 transitions. Word has length 48 [2025-03-03 16:05:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:29,954 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 3110 transitions. [2025-03-03 16:05:29,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 3110 transitions. [2025-03-03 16:05:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:29,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:29,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:29,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:05:29,954 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:29,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:29,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1031000681, now seen corresponding path program 1 times [2025-03-03 16:05:29,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:29,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035724834] [2025-03-03 16:05:29,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:29,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:29,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:29,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035724834] [2025-03-03 16:05:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035724834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:29,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335239847] [2025-03-03 16:05:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:29,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:29,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:29,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:29,993 INFO L87 Difference]: Start difference. First operand 1735 states and 3110 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:30,019 INFO L93 Difference]: Finished difference Result 2109 states and 3670 transitions. [2025-03-03 16:05:30,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:30,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:30,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:30,025 INFO L225 Difference]: With dead ends: 2109 [2025-03-03 16:05:30,025 INFO L226 Difference]: Without dead ends: 1910 [2025-03-03 16:05:30,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:30,026 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:30,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-03-03 16:05:30,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1908. [2025-03-03 16:05:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1906 states have (on average 1.763903462749213) internal successors, (3362), 1907 states have internal predecessors, (3362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 3362 transitions. [2025-03-03 16:05:30,058 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 3362 transitions. Word has length 48 [2025-03-03 16:05:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,059 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 3362 transitions. [2025-03-03 16:05:30,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 3362 transitions. [2025-03-03 16:05:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:30,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:05:30,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash -615824809, now seen corresponding path program 1 times [2025-03-03 16:05:30,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461989353] [2025-03-03 16:05:30,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:30,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:30,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:30,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461989353] [2025-03-03 16:05:30,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461989353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9531708] [2025-03-03 16:05:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:30,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:30,113 INFO L87 Difference]: Start difference. First operand 1908 states and 3362 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:30,142 INFO L93 Difference]: Finished difference Result 2604 states and 4384 transitions. [2025-03-03 16:05:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:30,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:30,149 INFO L225 Difference]: With dead ends: 2604 [2025-03-03 16:05:30,149 INFO L226 Difference]: Without dead ends: 2232 [2025-03-03 16:05:30,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:30,151 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:30,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-03-03 16:05:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2230. [2025-03-03 16:05:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2228 states have (on average 1.7136445242369838) internal successors, (3818), 2229 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3818 transitions. [2025-03-03 16:05:30,189 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3818 transitions. Word has length 48 [2025-03-03 16:05:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,189 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 3818 transitions. [2025-03-03 16:05:30,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3818 transitions. [2025-03-03 16:05:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:05:30,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:05:30,190 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1102543081, now seen corresponding path program 1 times [2025-03-03 16:05:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569943391] [2025-03-03 16:05:30,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:05:30,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:05:30,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569943391] [2025-03-03 16:05:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569943391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995342644] [2025-03-03 16:05:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:30,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:30,251 INFO L87 Difference]: Start difference. First operand 2230 states and 3818 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:30,285 INFO L93 Difference]: Finished difference Result 3522 states and 5668 transitions. [2025-03-03 16:05:30,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:30,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 16:05:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:30,292 INFO L225 Difference]: With dead ends: 3522 [2025-03-03 16:05:30,293 INFO L226 Difference]: Without dead ends: 2828 [2025-03-03 16:05:30,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:30,294 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:30,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:30,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2025-03-03 16:05:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2826. [2025-03-03 16:05:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2824 states have (on average 1.6409348441926346) internal successors, (4634), 2825 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4634 transitions. [2025-03-03 16:05:30,369 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4634 transitions. Word has length 48 [2025-03-03 16:05:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,369 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4634 transitions. [2025-03-03 16:05:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4634 transitions. [2025-03-03 16:05:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:30,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:05:30,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash -492453955, now seen corresponding path program 1 times [2025-03-03 16:05:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969378097] [2025-03-03 16:05:30,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:30,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:05:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969378097] [2025-03-03 16:05:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969378097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806182841] [2025-03-03 16:05:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:30,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:30,472 INFO L87 Difference]: Start difference. First operand 2826 states and 4634 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:30,603 INFO L93 Difference]: Finished difference Result 7916 states and 11823 transitions. [2025-03-03 16:05:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:30,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:05:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:30,628 INFO L225 Difference]: With dead ends: 7916 [2025-03-03 16:05:30,629 INFO L226 Difference]: Without dead ends: 6986 [2025-03-03 16:05:30,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:05:30,634 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4647 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:30,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3372 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6986 states. [2025-03-03 16:05:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6986 to 3938. [2025-03-03 16:05:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3936 states have (on average 1.5716463414634145) internal successors, (6186), 3937 states have internal predecessors, (6186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 6186 transitions. [2025-03-03 16:05:30,728 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 6186 transitions. Word has length 65 [2025-03-03 16:05:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:30,728 INFO L471 AbstractCegarLoop]: Abstraction has 3938 states and 6186 transitions. [2025-03-03 16:05:30,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 6186 transitions. [2025-03-03 16:05:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:30,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:30,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:30,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:05:30,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:30,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash -940399491, now seen corresponding path program 1 times [2025-03-03 16:05:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271101387] [2025-03-03 16:05:30,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:30,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:30,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:30,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:30,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:05:30,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:30,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271101387] [2025-03-03 16:05:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271101387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:30,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927903758] [2025-03-03 16:05:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:30,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:30,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:30,880 INFO L87 Difference]: Start difference. First operand 3938 states and 6186 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:31,040 INFO L93 Difference]: Finished difference Result 9204 states and 13631 transitions. [2025-03-03 16:05:31,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:31,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:05:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:31,057 INFO L225 Difference]: With dead ends: 9204 [2025-03-03 16:05:31,057 INFO L226 Difference]: Without dead ends: 7914 [2025-03-03 16:05:31,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:05:31,061 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:31,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:31,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7914 states. [2025-03-03 16:05:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7914 to 5690. [2025-03-03 16:05:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5688 states have (on average 1.5165260196905765) internal successors, (8626), 5689 states have internal predecessors, (8626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8626 transitions. [2025-03-03 16:05:31,195 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8626 transitions. Word has length 65 [2025-03-03 16:05:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8626 transitions. [2025-03-03 16:05:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8626 transitions. [2025-03-03 16:05:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:31,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:31,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:31,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:05:31,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:31,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:31,198 INFO L85 PathProgramCache]: Analyzing trace with hash -525223619, now seen corresponding path program 1 times [2025-03-03 16:05:31,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:31,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464288435] [2025-03-03 16:05:31,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:31,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:31,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:31,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:31,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:05:31,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:31,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464288435] [2025-03-03 16:05:31,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464288435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:31,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:31,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254023634] [2025-03-03 16:05:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:31,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:31,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:31,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:31,340 INFO L87 Difference]: Start difference. First operand 5690 states and 8626 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:31,719 INFO L93 Difference]: Finished difference Result 10492 states and 15431 transitions. [2025-03-03 16:05:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:05:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:31,743 INFO L225 Difference]: With dead ends: 10492 [2025-03-03 16:05:31,743 INFO L226 Difference]: Without dead ends: 9202 [2025-03-03 16:05:31,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:05:31,749 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4669 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:31,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 3349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:05:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9202 states. [2025-03-03 16:05:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9202 to 6978. [2025-03-03 16:05:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6978 states, 6976 states have (on average 1.494552752293578) internal successors, (10426), 6977 states have internal predecessors, (10426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6978 states to 6978 states and 10426 transitions. [2025-03-03 16:05:31,893 INFO L78 Accepts]: Start accepts. Automaton has 6978 states and 10426 transitions. Word has length 65 [2025-03-03 16:05:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:31,893 INFO L471 AbstractCegarLoop]: Abstraction has 6978 states and 10426 transitions. [2025-03-03 16:05:31,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6978 states and 10426 transitions. [2025-03-03 16:05:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:05:31,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:31,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:05:31,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:31,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1011941891, now seen corresponding path program 1 times [2025-03-03 16:05:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896951828] [2025-03-03 16:05:31,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:31,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:05:31,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:05:31,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:31,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:05:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896951828] [2025-03-03 16:05:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896951828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:32,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:05:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322418515] [2025-03-03 16:05:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:05:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:32,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:05:32,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:05:32,020 INFO L87 Difference]: Start difference. First operand 6978 states and 10426 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:32,191 INFO L93 Difference]: Finished difference Result 11780 states and 17231 transitions. [2025-03-03 16:05:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:05:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:05:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:32,209 INFO L225 Difference]: With dead ends: 11780 [2025-03-03 16:05:32,210 INFO L226 Difference]: Without dead ends: 10490 [2025-03-03 16:05:32,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:05:32,215 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4659 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4659 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:32,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4659 Valid, 3367 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10490 states. [2025-03-03 16:05:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10490 to 8266. [2025-03-03 16:05:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8264 states have (on average 1.479428848015489) internal successors, (12226), 8265 states have internal predecessors, (12226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 12226 transitions. [2025-03-03 16:05:32,424 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 12226 transitions. Word has length 65 [2025-03-03 16:05:32,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:32,425 INFO L471 AbstractCegarLoop]: Abstraction has 8266 states and 12226 transitions. [2025-03-03 16:05:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 12226 transitions. [2025-03-03 16:05:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:05:32,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:32,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:32,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:05:32,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 78192369, now seen corresponding path program 1 times [2025-03-03 16:05:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216451550] [2025-03-03 16:05:32,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:32,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:05:32,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:05:32,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:32,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:32,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216451550] [2025-03-03 16:05:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216451550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703653860] [2025-03-03 16:05:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:32,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:32,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,500 INFO L87 Difference]: Start difference. First operand 8266 states and 12226 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:32,587 INFO L93 Difference]: Finished difference Result 14998 states and 21644 transitions. [2025-03-03 16:05:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:32,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 16:05:32,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:32,601 INFO L225 Difference]: With dead ends: 14998 [2025-03-03 16:05:32,601 INFO L226 Difference]: Without dead ends: 8268 [2025-03-03 16:05:32,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,611 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:32,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8268 states. [2025-03-03 16:05:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8268 to 8266. [2025-03-03 16:05:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8266 states, 8264 states have (on average 1.4644240077444337) internal successors, (12102), 8265 states have internal predecessors, (12102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 12102 transitions. [2025-03-03 16:05:32,831 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 12102 transitions. Word has length 66 [2025-03-03 16:05:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:32,831 INFO L471 AbstractCegarLoop]: Abstraction has 8266 states and 12102 transitions. [2025-03-03 16:05:32,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 12102 transitions. [2025-03-03 16:05:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:05:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:32,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:32,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:05:32,833 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:32,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash -628102213, now seen corresponding path program 1 times [2025-03-03 16:05:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:32,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476922281] [2025-03-03 16:05:32,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:32,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:32,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:05:32,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:05:32,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:32,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476922281] [2025-03-03 16:05:32,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476922281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:32,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:32,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:32,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483037260] [2025-03-03 16:05:32,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:32,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:32,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:32,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:32,977 INFO L87 Difference]: Start difference. First operand 8266 states and 12102 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:33,033 INFO L93 Difference]: Finished difference Result 10839 states and 15686 transitions. [2025-03-03 16:05:33,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:33,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:05:33,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:33,045 INFO L225 Difference]: With dead ends: 10839 [2025-03-03 16:05:33,045 INFO L226 Difference]: Without dead ends: 4109 [2025-03-03 16:05:33,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:33,057 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:33,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2025-03-03 16:05:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4101. [2025-03-03 16:05:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4099 states have (on average 1.5469626738228837) internal successors, (6341), 4100 states have internal predecessors, (6341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6341 transitions. [2025-03-03 16:05:33,122 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6341 transitions. Word has length 67 [2025-03-03 16:05:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6341 transitions. [2025-03-03 16:05:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6341 transitions. [2025-03-03 16:05:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:05:33,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:33,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:33,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:05:33,124 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:33,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 667894008, now seen corresponding path program 1 times [2025-03-03 16:05:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844069284] [2025-03-03 16:05:33,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:33,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:05:33,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:05:33,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:33,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844069284] [2025-03-03 16:05:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844069284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:33,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074298964] [2025-03-03 16:05:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:33,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:33,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:33,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:33,222 INFO L87 Difference]: Start difference. First operand 4101 states and 6341 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:33,251 INFO L93 Difference]: Finished difference Result 5381 states and 8103 transitions. [2025-03-03 16:05:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:33,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 16:05:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:33,257 INFO L225 Difference]: With dead ends: 5381 [2025-03-03 16:05:33,257 INFO L226 Difference]: Without dead ends: 2827 [2025-03-03 16:05:33,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:33,260 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:33,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2025-03-03 16:05:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2825. [2025-03-03 16:05:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2823 states have (on average 1.6149486362026213) internal successors, (4559), 2824 states have internal predecessors, (4559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4559 transitions. [2025-03-03 16:05:33,297 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4559 transitions. Word has length 68 [2025-03-03 16:05:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:33,297 INFO L471 AbstractCegarLoop]: Abstraction has 2825 states and 4559 transitions. [2025-03-03 16:05:33,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4559 transitions. [2025-03-03 16:05:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:05:33,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:33,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:05:33,298 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1675746273, now seen corresponding path program 1 times [2025-03-03 16:05:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155285901] [2025-03-03 16:05:33,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:33,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:05:33,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:05:33,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:33,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155285901] [2025-03-03 16:05:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155285901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:05:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:05:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:05:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523011518] [2025-03-03 16:05:33,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:05:33,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:05:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:33,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:05:33,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:33,364 INFO L87 Difference]: Start difference. First operand 2825 states and 4559 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:33,386 INFO L93 Difference]: Finished difference Result 3467 states and 5430 transitions. [2025-03-03 16:05:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:05:33,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 16:05:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:33,390 INFO L225 Difference]: With dead ends: 3467 [2025-03-03 16:05:33,391 INFO L226 Difference]: Without dead ends: 2189 [2025-03-03 16:05:33,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:05:33,393 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:33,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:05:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-03-03 16:05:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2187. [2025-03-03 16:05:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2187 states, 2185 states have (on average 1.6837528604118994) internal successors, (3679), 2186 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 2187 states and 3679 transitions. [2025-03-03 16:05:33,418 INFO L78 Accepts]: Start accepts. Automaton has 2187 states and 3679 transitions. Word has length 70 [2025-03-03 16:05:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 2187 states and 3679 transitions. [2025-03-03 16:05:33,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 3679 transitions. [2025-03-03 16:05:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:05:33,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:33,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:33,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:05:33,419 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 642136166, now seen corresponding path program 1 times [2025-03-03 16:05:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087176868] [2025-03-03 16:05:33,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:33,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:05:33,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:05:33,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:33,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087176868] [2025-03-03 16:05:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087176868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303468058] [2025-03-03 16:05:34,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:34,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:34,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:34,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:34,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:05:34,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:05:34,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:05:34,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:34,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:34,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 16:05:34,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:34,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:35,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303468058] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:35,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:05:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353729063] [2025-03-03 16:05:35,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:35,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:05:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:35,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:05:35,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:05:35,147 INFO L87 Difference]: Start difference. First operand 2187 states and 3679 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:38,086 INFO L93 Difference]: Finished difference Result 7155 states and 10234 transitions. [2025-03-03 16:05:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-03 16:05:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 16:05:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:38,095 INFO L225 Difference]: With dead ends: 7155 [2025-03-03 16:05:38,095 INFO L226 Difference]: Without dead ends: 6449 [2025-03-03 16:05:38,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1199, Invalid=6283, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 16:05:38,099 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 20897 mSDsluCounter, 7900 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20897 SdHoareTripleChecker+Valid, 9411 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20897 Valid, 9411 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 16:05:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2025-03-03 16:05:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 5989. [2025-03-03 16:05:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5989 states, 5987 states have (on average 1.4317688324703524) internal successors, (8572), 5988 states have internal predecessors, (8572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5989 states to 5989 states and 8572 transitions. [2025-03-03 16:05:38,258 INFO L78 Accepts]: Start accepts. Automaton has 5989 states and 8572 transitions. Word has length 72 [2025-03-03 16:05:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:38,258 INFO L471 AbstractCegarLoop]: Abstraction has 5989 states and 8572 transitions. [2025-03-03 16:05:38,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5989 states and 8572 transitions. [2025-03-03 16:05:38,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:05:38,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:38,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:38,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:05:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:38,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1347160917, now seen corresponding path program 1 times [2025-03-03 16:05:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202779601] [2025-03-03 16:05:38,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:38,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:38,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:38,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:38,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202779601] [2025-03-03 16:05:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202779601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631881473] [2025-03-03 16:05:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:39,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:39,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:39,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:39,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:05:39,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:39,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:39,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:39,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:39,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:05:39,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:39,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631881473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:40,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-03-03 16:05:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814675230] [2025-03-03 16:05:40,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 16:05:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:40,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 16:05:40,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-03 16:05:40,578 INFO L87 Difference]: Start difference. First operand 5989 states and 8572 transitions. Second operand has 27 states, 27 states have (on average 7.0) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:41,115 INFO L93 Difference]: Finished difference Result 14621 states and 19789 transitions. [2025-03-03 16:05:41,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 16:05:41,115 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 16:05:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:41,132 INFO L225 Difference]: With dead ends: 14621 [2025-03-03 16:05:41,132 INFO L226 Difference]: Without dead ends: 10522 [2025-03-03 16:05:41,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1157, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 16:05:41,138 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 23828 mSDsluCounter, 4732 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23828 SdHoareTripleChecker+Valid, 6236 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:41,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23828 Valid, 6236 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:05:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10522 states. [2025-03-03 16:05:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10522 to 10394. [2025-03-03 16:05:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10394 states, 10392 states have (on average 1.3575827559661278) internal successors, (14108), 10393 states have internal predecessors, (14108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 14108 transitions. [2025-03-03 16:05:41,369 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 14108 transitions. Word has length 73 [2025-03-03 16:05:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:41,369 INFO L471 AbstractCegarLoop]: Abstraction has 10394 states and 14108 transitions. [2025-03-03 16:05:41,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 26 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 14108 transitions. [2025-03-03 16:05:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:05:41,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:41,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:41,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:05:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-03 16:05:41,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:41,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2020405483, now seen corresponding path program 1 times [2025-03-03 16:05:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246606319] [2025-03-03 16:05:41,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:41,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:41,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:41,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:41,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246606319] [2025-03-03 16:05:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246606319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:41,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897890605] [2025-03-03 16:05:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:41,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:41,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:41,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:05:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:05:41,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:05:41,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:41,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:41,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:05:41,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:42,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:42,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897890605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:42,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-03 16:05:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438596294] [2025-03-03 16:05:42,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:42,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 16:05:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:42,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 16:05:42,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-03 16:05:42,873 INFO L87 Difference]: Start difference. First operand 10394 states and 14108 transitions. Second operand has 26 states, 26 states have (on average 6.961538461538462) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:44,384 INFO L93 Difference]: Finished difference Result 42734 states and 55739 transitions. [2025-03-03 16:05:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 16:05:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.961538461538462) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 16:05:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:44,432 INFO L225 Difference]: With dead ends: 42734 [2025-03-03 16:05:44,433 INFO L226 Difference]: Without dead ends: 34148 [2025-03-03 16:05:44,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=629, Invalid=2341, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 16:05:44,443 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 19884 mSDsluCounter, 6509 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19884 SdHoareTripleChecker+Valid, 8030 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:44,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19884 Valid, 8030 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:05:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34148 states. [2025-03-03 16:05:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34148 to 33704. [2025-03-03 16:05:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33704 states, 33702 states have (on average 1.2799537119458786) internal successors, (43137), 33703 states have internal predecessors, (43137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33704 states to 33704 states and 43137 transitions. [2025-03-03 16:05:45,421 INFO L78 Accepts]: Start accepts. Automaton has 33704 states and 43137 transitions. Word has length 73 [2025-03-03 16:05:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:45,421 INFO L471 AbstractCegarLoop]: Abstraction has 33704 states and 43137 transitions. [2025-03-03 16:05:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.961538461538462) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 33704 states and 43137 transitions. [2025-03-03 16:05:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 16:05:45,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:45,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:45,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:05:45,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:45,628 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:45,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 2004390495, now seen corresponding path program 1 times [2025-03-03 16:05:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826310835] [2025-03-03 16:05:45,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:45,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:05:45,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:05:45,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:45,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826310835] [2025-03-03 16:05:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826310835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39409782] [2025-03-03 16:05:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:45,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:45,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:45,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:45,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:05:45,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:05:46,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:05:46,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:46,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:46,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:05:46,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:46,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:46,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39409782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:46,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:46,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-03 16:05:46,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374639741] [2025-03-03 16:05:46,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:46,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:05:46,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:46,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:05:46,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:05:46,716 INFO L87 Difference]: Start difference. First operand 33704 states and 43137 transitions. Second operand has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 21 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:05:47,662 INFO L93 Difference]: Finished difference Result 63692 states and 81003 transitions. [2025-03-03 16:05:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:05:47,669 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 21 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 16:05:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:05:47,723 INFO L225 Difference]: With dead ends: 63692 [2025-03-03 16:05:47,723 INFO L226 Difference]: Without dead ends: 35076 [2025-03-03 16:05:47,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 16:05:47,743 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 12249 mSDsluCounter, 3342 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12249 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:05:47,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12249 Valid, 4855 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:05:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35076 states. [2025-03-03 16:05:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35076 to 33020. [2025-03-03 16:05:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33020 states, 33018 states have (on average 1.2688230662063118) internal successors, (41894), 33019 states have internal predecessors, (41894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33020 states to 33020 states and 41894 transitions. [2025-03-03 16:05:48,688 INFO L78 Accepts]: Start accepts. Automaton has 33020 states and 41894 transitions. Word has length 74 [2025-03-03 16:05:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:05:48,689 INFO L471 AbstractCegarLoop]: Abstraction has 33020 states and 41894 transitions. [2025-03-03 16:05:48,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.590909090909091) internal successors, (167), 21 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:05:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 33020 states and 41894 transitions. [2025-03-03 16:05:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:05:48,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:05:48,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:05:48,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:05:48,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:48,892 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:05:48,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:05:48,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1202430224, now seen corresponding path program 1 times [2025-03-03 16:05:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:05:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671587577] [2025-03-03 16:05:48,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:05:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:05:48,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:05:48,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:48,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:05:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671587577] [2025-03-03 16:05:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671587577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:05:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314080344] [2025-03-03 16:05:49,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:05:49,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:05:49,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:05:49,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:05:49,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:05:49,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:05:49,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:05:49,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:05:49,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:05:49,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 16:05:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:05:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:54,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:05:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:05:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314080344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:05:57,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:05:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 22] total 52 [2025-03-03 16:05:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573473363] [2025-03-03 16:05:57,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:05:57,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-03 16:05:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:05:57,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-03 16:05:57,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2321, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 16:05:57,386 INFO L87 Difference]: Start difference. First operand 33020 states and 41894 transitions. Second operand has 52 states, 52 states have (on average 3.9038461538461537) internal successors, (203), 52 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:03,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 16:06:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:27,939 INFO L93 Difference]: Finished difference Result 73606 states and 92787 transitions. [2025-03-03 16:06:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-03 16:06:27,940 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.9038461538461537) internal successors, (203), 52 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 16:06:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:27,997 INFO L225 Difference]: With dead ends: 73606 [2025-03-03 16:06:27,997 INFO L226 Difference]: Without dead ends: 53836 [2025-03-03 16:06:28,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11615 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=6137, Invalid=25725, Unknown=0, NotChecked=0, Total=31862 [2025-03-03 16:06:28,014 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 19074 mSDsluCounter, 21011 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 111 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19074 SdHoareTripleChecker+Valid, 22548 SdHoareTripleChecker+Invalid, 3735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:28,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19074 Valid, 22548 Invalid, 3735 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [111 Valid, 3623 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-03-03 16:06:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53836 states. [2025-03-03 16:06:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53836 to 30828. [2025-03-03 16:06:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30828 states, 30826 states have (on average 1.2670797378836047) internal successors, (39059), 30827 states have internal predecessors, (39059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30828 states to 30828 states and 39059 transitions. [2025-03-03 16:06:29,043 INFO L78 Accepts]: Start accepts. Automaton has 30828 states and 39059 transitions. Word has length 75 [2025-03-03 16:06:29,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:29,043 INFO L471 AbstractCegarLoop]: Abstraction has 30828 states and 39059 transitions. [2025-03-03 16:06:29,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.9038461538461537) internal successors, (203), 52 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 30828 states and 39059 transitions. [2025-03-03 16:06:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:06:29,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:29,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:29,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 16:06:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:06:29,245 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1437669918, now seen corresponding path program 1 times [2025-03-03 16:06:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119268846] [2025-03-03 16:06:29,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:29,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:06:29,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:06:29,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:29,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119268846] [2025-03-03 16:06:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119268846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901794928] [2025-03-03 16:06:30,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:30,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:30,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:30,547 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:30,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 16:06:30,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:06:30,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:06:30,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:30,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:30,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:06:30,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:31,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:06:32,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901794928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:06:32,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:06:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 13] total 48 [2025-03-03 16:06:32,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742627107] [2025-03-03 16:06:32,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:06:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 16:06:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 16:06:32,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2084, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 16:06:32,173 INFO L87 Difference]: Start difference. First operand 30828 states and 39059 transitions. Second operand has 48 states, 48 states have (on average 4.020833333333333) internal successors, (193), 48 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)