./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:46:22,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:46:22,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:46:22,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:46:22,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:46:22,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:46:22,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:46:22,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:46:22,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:46:22,717 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:46:22,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:46:22,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:46:22,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:46:22,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:46:22,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:46:22,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:46:22,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:46:22,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:46:22,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:46:22,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:46:22,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:46:22,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:46:22,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:46:22,721 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 -> f04db10568a800b95189a827d616dfd35581f855ab463aa07cbc605d28fef196 [2025-03-17 03:46:22,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:46:22,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:46:22,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:46:22,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:46:22,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:46:22,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2025-03-17 03:46:24,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a737e685e/dd9c3e7805e54b409e9963536f2447b6/FLAG86a68480c [2025-03-17 03:46:24,539 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:46:24,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2025-03-17 03:46:24,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a737e685e/dd9c3e7805e54b409e9963536f2447b6/FLAG86a68480c [2025-03-17 03:46:24,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a737e685e/dd9c3e7805e54b409e9963536f2447b6 [2025-03-17 03:46:24,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:46:24,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:46:24,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:46:24,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:46:24,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:46:24,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24, skipping insertion in model container [2025-03-17 03:46:24,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:46:24,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i[915,928] [2025-03-17 03:46:24,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:46:24,792 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:46:24,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i[915,928] [2025-03-17 03:46:24,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:46:24,844 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:46:24,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24 WrapperNode [2025-03-17 03:46:24,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:46:24,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:46:24,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:46:24,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:46:24,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,900 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-17 03:46:24,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:46:24,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:46:24,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:46:24,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:46:24,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,947 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-17 03:46:24,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,955 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:46:24,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:46:24,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:46:24,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:46:24,962 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (1/1) ... [2025-03-17 03:46:24,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:46:24,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:46:24,996 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-17 03:46:25,003 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-17 03:46:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:46:25,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:46:25,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:46:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:46:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:46:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:46:25,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:46:25,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:46:25,514 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise16#1;havoc property_#t~ite18#1;havoc property_#t~bitwise17#1;havoc property_#t~short19#1; [2025-03-17 03:46:25,544 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-17 03:46:25,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:46:25,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:46:25,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:46:25,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:25 BoogieIcfgContainer [2025-03-17 03:46:25,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:46:25,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:46:25,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:46:25,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:46:25,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:46:24" (1/3) ... [2025-03-17 03:46:25,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249ce4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:25, skipping insertion in model container [2025-03-17 03:46:25,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:46:24" (2/3) ... [2025-03-17 03:46:25,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249ce4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:46:25, skipping insertion in model container [2025-03-17 03:46:25,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:46:25" (3/3) ... [2025-03-17 03:46:25,571 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-10.i [2025-03-17 03:46:25,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:46:25,585 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-10.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:46:25,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:46:25,642 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;@1a84bf4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:46:25,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:46:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:46:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 03:46:25,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:25,661 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:25,661 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:25,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1745380872, now seen corresponding path program 1 times [2025-03-17 03:46:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:46:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216570504] [2025-03-17 03:46:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:46:25,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:46:25,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:46:25,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:25,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 03:46:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:46:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216570504] [2025-03-17 03:46:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216570504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:46:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319287996] [2025-03-17 03:46:25,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:25,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:46:25,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:46:25,935 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-17 03:46:25,947 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-17 03:46:26,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:46:26,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:46:26,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:26,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:26,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:46:26,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:46:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 03:46:26,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:46:26,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319287996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:46:26,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:46:26,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:46:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151147932] [2025-03-17 03:46:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:46:26,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:46:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:46:26,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:46:26,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:46:26,143 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:46:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:46:26,163 INFO L93 Difference]: Finished difference Result 137 states and 225 transitions. [2025-03-17 03:46:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:46:26,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-03-17 03:46:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:46:26,169 INFO L225 Difference]: With dead ends: 137 [2025-03-17 03:46:26,169 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 03:46:26,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:46:26,178 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:46:26,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:46:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 03:46:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 03:46:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 03:46:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2025-03-17 03:46:26,229 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 119 [2025-03-17 03:46:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:46:26,229 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2025-03-17 03:46:26,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:46:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2025-03-17 03:46:26,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 03:46:26,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:26,232 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:26,241 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-17 03:46:26,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:46:26,436 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:26,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 801232216, now seen corresponding path program 1 times [2025-03-17 03:46:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:46:26,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49179184] [2025-03-17 03:46:26,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:46:26,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 03:46:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 03:46:26,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:26,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:46:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 03:46:26,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:46:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49179184] [2025-03-17 03:46:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49179184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:46:26,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:46:26,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:46:26,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389106392] [2025-03-17 03:46:26,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:46:26,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:46:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:46:26,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:46:26,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:46:26,918 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 03:46:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:46:27,082 INFO L93 Difference]: Finished difference Result 200 states and 299 transitions. [2025-03-17 03:46:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:46:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-17 03:46:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:46:27,085 INFO L225 Difference]: With dead ends: 200 [2025-03-17 03:46:27,085 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 03:46:27,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:46:27,087 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:46:27,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 269 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:46:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 03:46:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2025-03-17 03:46:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 03:46:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2025-03-17 03:46:27,106 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 150 transitions. Word has length 119 [2025-03-17 03:46:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:46:27,107 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 150 transitions. [2025-03-17 03:46:27,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 03:46:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2025-03-17 03:46:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 03:46:27,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:46:27,110 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:46:27,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:46:27,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:46:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:46:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash 502301020, now seen corresponding path program 1 times [2025-03-17 03:46:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:46:27,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191112111] [2025-03-17 03:46:27,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:46:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:46:27,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 03:46:27,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 03:46:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:46:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:47:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 03:47:11,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:47:11,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191112111] [2025-03-17 03:47:11,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191112111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:47:11,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:47:11,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:47:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691456988] [2025-03-17 03:47:11,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:47:11,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:47:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:47:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:47:11,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:47:11,650 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:47:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:47:13,069 INFO L93 Difference]: Finished difference Result 324 states and 468 transitions. [2025-03-17 03:47:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 03:47:13,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2025-03-17 03:47:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:47:13,071 INFO L225 Difference]: With dead ends: 324 [2025-03-17 03:47:13,071 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 03:47:13,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-03-17 03:47:13,072 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 475 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:47:13,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 547 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:47:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 03:47:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 191. [2025-03-17 03:47:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 131 states have internal predecessors, (167), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 03:47:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2025-03-17 03:47:13,109 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 120 [2025-03-17 03:47:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:47:13,109 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2025-03-17 03:47:13,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 03:47:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2025-03-17 03:47:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 03:47:13,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:47:13,111 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:47:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:47:13,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:47:13,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:47:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1815687620, now seen corresponding path program 1 times [2025-03-17 03:47:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:47:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134956455] [2025-03-17 03:47:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:47:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:47:13,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 03:47:13,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 03:47:13,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:47:13,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:47:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 03:47:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:47:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134956455] [2025-03-17 03:47:51,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134956455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:47:51,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:47:51,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:47:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358781533] [2025-03-17 03:47:51,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:47:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:47:51,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:47:51,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:47:51,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:47:51,914 INFO L87 Difference]: Start difference. First operand 191 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 03:47:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:47:52,839 INFO L93 Difference]: Finished difference Result 413 states and 586 transitions. [2025-03-17 03:47:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 03:47:52,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2025-03-17 03:47:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:47:52,843 INFO L225 Difference]: With dead ends: 413 [2025-03-17 03:47:52,843 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 03:47:52,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:47:52,845 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 160 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:47:52,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 515 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:47:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 03:47:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 193. [2025-03-17 03:47:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 133 states have internal predecessors, (169), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 03:47:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 277 transitions. [2025-03-17 03:47:52,876 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 277 transitions. Word has length 120 [2025-03-17 03:47:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:47:52,879 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 277 transitions. [2025-03-17 03:47:52,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 03:47:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 277 transitions. [2025-03-17 03:47:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 03:47:52,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:47:52,883 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:47:52,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:47:52,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:47:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:47:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash -494771333, now seen corresponding path program 1 times [2025-03-17 03:47:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:47:52,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506333297] [2025-03-17 03:47:52,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:47:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:47:52,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 03:47:52,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 03:47:52,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:47:52,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat