./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.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 e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:31:57,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:31:57,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:31:57,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:31:57,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:31:57,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:31:57,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:31:57,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:31:57,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:31:57,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:31:57,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:31:57,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:31:57,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:31:57,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:31:57,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:31:57,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:31:57,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:31:57,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:31:57,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:31:57,327 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 -> e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b [2025-03-03 20:31:57,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:31:57,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:31:57,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:31:57,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:31:57,558 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:31:57,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-03 20:31:58,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c769fd792/5b657343768242ad953ea8637fc232cd/FLAG75a80cdcd [2025-03-03 20:31:58,990 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:31:58,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-03 20:31:59,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c769fd792/5b657343768242ad953ea8637fc232cd/FLAG75a80cdcd [2025-03-03 20:31:59,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c769fd792/5b657343768242ad953ea8637fc232cd [2025-03-03 20:31:59,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:31:59,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:31:59,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:31:59,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:31:59,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:31:59,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367aa7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59, skipping insertion in model container [2025-03-03 20:31:59,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:31:59,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i[919,932] [2025-03-03 20:31:59,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:31:59,504 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:31:59,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i[919,932] [2025-03-03 20:31:59,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:31:59,567 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:31:59,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59 WrapperNode [2025-03-03 20:31:59,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:31:59,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:31:59,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:31:59,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:31:59,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,609 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-03-03 20:31:59,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:31:59,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:31:59,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:31:59,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:31:59,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,629 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 20:31:59,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:31:59,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:31:59,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:31:59,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:31:59,640 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (1/1) ... [2025-03-03 20:31:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:31:59,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:31:59,670 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 20:31:59,673 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 20:31:59,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:31:59,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:31:59,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:31:59,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:31:59,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:31:59,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:31:59,755 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:31:59,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:32:00,037 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:32:00,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:32:00,044 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:32:00,047 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:32:00,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:32:00 BoogieIcfgContainer [2025-03-03 20:32:00,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:32:00,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:32:00,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:32:00,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:32:00,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:31:59" (1/3) ... [2025-03-03 20:32:00,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d3ae09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:32:00, skipping insertion in model container [2025-03-03 20:32:00,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:31:59" (2/3) ... [2025-03-03 20:32:00,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d3ae09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:32:00, skipping insertion in model container [2025-03-03 20:32:00,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:32:00" (3/3) ... [2025-03-03 20:32:00,057 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-03 20:32:00,068 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:32:00,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:32:00,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:32:00,117 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;@79cb5b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:32:00,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:32:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:32:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 20:32:00,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:00,132 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:00,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:00,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash -62546371, now seen corresponding path program 1 times [2025-03-03 20:32:00,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:00,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438913505] [2025-03-03 20:32:00,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:00,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 20:32:00,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 20:32:00,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:00,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 20:32:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:00,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438913505] [2025-03-03 20:32:00,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438913505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:32:00,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595709883] [2025-03-03 20:32:00,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:32:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:32:00,442 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 20:32:00,443 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 20:32:00,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 20:32:00,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 20:32:00,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:00,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:32:00,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:32:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-03 20:32:00,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:32:00,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595709883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:00,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:32:00,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:32:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189272100] [2025-03-03 20:32:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:00,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:32:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:00,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:32:00,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:32:00,607 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:00,627 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2025-03-03 20:32:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:32:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-03 20:32:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:00,633 INFO L225 Difference]: With dead ends: 154 [2025-03-03 20:32:00,633 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 20:32:00,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-03 20:32:00,637 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:00,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:32:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 20:32:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 20:32:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:32:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2025-03-03 20:32:00,669 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149 [2025-03-03 20:32:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:00,669 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2025-03-03 20:32:00,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:00,669 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2025-03-03 20:32:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 20:32:00,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:00,672 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:00,679 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 20:32:00,877 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-03 20:32:00,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 569304379, now seen corresponding path program 1 times [2025-03-03 20:32:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52155826] [2025-03-03 20:32:00,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:00,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 20:32:00,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 20:32:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:01,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52155826] [2025-03-03 20:32:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52155826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:32:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761950252] [2025-03-03 20:32:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:01,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:32:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:01,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:32:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:32:01,185 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:01,339 INFO L93 Difference]: Finished difference Result 189 states and 295 transitions. [2025-03-03 20:32:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:32:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-03 20:32:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:01,343 INFO L225 Difference]: With dead ends: 189 [2025-03-03 20:32:01,343 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 20:32:01,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 20:32:01,346 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 139 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:01,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 213 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:32:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 20:32:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2025-03-03 20:32:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 78 states have internal predecessors, (109), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:32:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2025-03-03 20:32:01,368 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 149 [2025-03-03 20:32:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:01,369 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2025-03-03 20:32:01,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2025-03-03 20:32:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 20:32:01,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:01,371 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:01,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:32:01,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:01,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1238150084, now seen corresponding path program 1 times [2025-03-03 20:32:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:01,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948160096] [2025-03-03 20:32:01,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 20:32:01,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 20:32:01,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:01,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:01,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948160096] [2025-03-03 20:32:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948160096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:32:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874525094] [2025-03-03 20:32:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:01,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:32:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:01,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:32:01,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:32:01,793 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:02,257 INFO L93 Difference]: Finished difference Result 407 states and 590 transitions. [2025-03-03 20:32:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:32:02,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-03 20:32:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:02,261 INFO L225 Difference]: With dead ends: 407 [2025-03-03 20:32:02,261 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 20:32:02,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:32:02,262 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 263 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:02,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 582 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:32:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 20:32:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 177. [2025-03-03 20:32:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.4558823529411764) internal successors, (198), 139 states have internal predecessors, (198), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:32:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 270 transitions. [2025-03-03 20:32:02,287 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 270 transitions. Word has length 149 [2025-03-03 20:32:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:02,287 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 270 transitions. [2025-03-03 20:32:02,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 270 transitions. [2025-03-03 20:32:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:02,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:02,289 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:02,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:32:02,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:02,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash -936820241, now seen corresponding path program 1 times [2025-03-03 20:32:02,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:02,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012518372] [2025-03-03 20:32:02,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:02,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:02,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:02,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:02,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:02,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 24 proven. 39 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 20:32:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012518372] [2025-03-03 20:32:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012518372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:32:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209667337] [2025-03-03 20:32:02,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:02,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:32:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:32:02,650 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 20:32:02,651 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 20:32:02,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:02,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:02,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:02,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:02,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:32:02,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:32:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-03 20:32:02,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:32:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 20:32:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209667337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:32:03,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:32:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-03 20:32:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889944374] [2025-03-03 20:32:03,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:32:03,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:32:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:03,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:32:03,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:32:03,136 INFO L87 Difference]: Start difference. First operand 177 states and 270 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 20:32:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:03,535 INFO L93 Difference]: Finished difference Result 365 states and 550 transitions. [2025-03-03 20:32:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:32:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 150 [2025-03-03 20:32:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:03,538 INFO L225 Difference]: With dead ends: 365 [2025-03-03 20:32:03,538 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 20:32:03,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2025-03-03 20:32:03,541 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 298 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:03,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 262 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:32:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 20:32:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2025-03-03 20:32:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.4028776978417266) internal successors, (195), 142 states have internal predecessors, (195), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 20:32:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2025-03-03 20:32:03,560 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 150 [2025-03-03 20:32:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:03,562 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2025-03-03 20:32:03,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 4 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-03-03 20:32:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2025-03-03 20:32:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:03,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:03,565 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:03,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:32:03,765 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,SelfDestructingSolverStorable3 [2025-03-03 20:32:03,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:03,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1618730038, now seen corresponding path program 1 times [2025-03-03 20:32:03,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:03,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99418728] [2025-03-03 20:32:03,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:03,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:03,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:03,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:03,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99418728] [2025-03-03 20:32:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99418728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:04,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:32:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191327413] [2025-03-03 20:32:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:04,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:32:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:04,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:32:04,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:32:04,022 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:04,184 INFO L93 Difference]: Finished difference Result 656 states and 947 transitions. [2025-03-03 20:32:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:32:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:04,186 INFO L225 Difference]: With dead ends: 656 [2025-03-03 20:32:04,186 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 20:32:04,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:32:04,187 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 186 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:04,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 237 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:32:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 20:32:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 398. [2025-03-03 20:32:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 331 states have (on average 1.4169184290030212) internal successors, (469), 338 states have internal predecessors, (469), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 47 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 20:32:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 577 transitions. [2025-03-03 20:32:04,219 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 577 transitions. Word has length 150 [2025-03-03 20:32:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:04,219 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 577 transitions. [2025-03-03 20:32:04,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2025-03-03 20:32:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:04,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:04,220 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:32:04,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:04,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash 879285899, now seen corresponding path program 1 times [2025-03-03 20:32:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:04,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780843905] [2025-03-03 20:32:04,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:04,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:04,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:04,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:04,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:12,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780843905] [2025-03-03 20:32:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780843905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:12,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:32:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704617888] [2025-03-03 20:32:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:32:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:12,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:32:12,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:32:12,901 INFO L87 Difference]: Start difference. First operand 398 states and 577 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:15,257 INFO L93 Difference]: Finished difference Result 1027 states and 1468 transitions. [2025-03-03 20:32:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:32:15,258 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:15,262 INFO L225 Difference]: With dead ends: 1027 [2025-03-03 20:32:15,262 INFO L226 Difference]: Without dead ends: 1025 [2025-03-03 20:32:15,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=241, Invalid=571, Unknown=0, NotChecked=0, Total=812 [2025-03-03 20:32:15,263 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 574 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:15,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 577 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:32:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-03 20:32:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 746. [2025-03-03 20:32:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 647 states have (on average 1.4358578052550233) internal successors, (929), 662 states have internal predecessors, (929), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 20:32:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1085 transitions. [2025-03-03 20:32:15,298 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1085 transitions. Word has length 150 [2025-03-03 20:32:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1085 transitions. [2025-03-03 20:32:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1085 transitions. [2025-03-03 20:32:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:15,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:15,300 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:32:15,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:15,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash 585882892, now seen corresponding path program 1 times [2025-03-03 20:32:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425402070] [2025-03-03 20:32:15,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:15,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:15,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:15,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:21,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:21,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425402070] [2025-03-03 20:32:21,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425402070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:21,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:21,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:32:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763089011] [2025-03-03 20:32:21,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:21,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:32:21,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:21,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:32:21,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:32:21,426 INFO L87 Difference]: Start difference. First operand 746 states and 1085 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:24,325 INFO L93 Difference]: Finished difference Result 1189 states and 1674 transitions. [2025-03-03 20:32:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 20:32:24,325 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:24,331 INFO L225 Difference]: With dead ends: 1189 [2025-03-03 20:32:24,331 INFO L226 Difference]: Without dead ends: 1187 [2025-03-03 20:32:24,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2025-03-03 20:32:24,332 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 734 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:24,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 603 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:32:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-03-03 20:32:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 706. [2025-03-03 20:32:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 607 states have (on average 1.4250411861614498) internal successors, (865), 622 states have internal predecessors, (865), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 20:32:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1021 transitions. [2025-03-03 20:32:24,382 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1021 transitions. Word has length 150 [2025-03-03 20:32:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:24,382 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1021 transitions. [2025-03-03 20:32:24,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1021 transitions. [2025-03-03 20:32:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:24,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:24,384 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:32:24,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:24,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash -474023798, now seen corresponding path program 1 times [2025-03-03 20:32:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186630086] [2025-03-03 20:32:24,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:24,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:24,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:24,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:24,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186630086] [2025-03-03 20:32:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186630086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:29,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:29,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-03 20:32:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310615134] [2025-03-03 20:32:29,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:29,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 20:32:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:29,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 20:32:29,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-03 20:32:29,371 INFO L87 Difference]: Start difference. First operand 706 states and 1021 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:34,080 INFO L93 Difference]: Finished difference Result 1161 states and 1638 transitions. [2025-03-03 20:32:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 20:32:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-03 20:32:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:34,088 INFO L225 Difference]: With dead ends: 1161 [2025-03-03 20:32:34,088 INFO L226 Difference]: Without dead ends: 1159 [2025-03-03 20:32:34,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 20:32:34,089 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 751 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:34,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 518 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 20:32:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-03 20:32:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 709. [2025-03-03 20:32:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 610 states have (on average 1.4262295081967213) internal successors, (870), 625 states have internal predecessors, (870), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 20:32:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1026 transitions. [2025-03-03 20:32:34,132 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1026 transitions. Word has length 150 [2025-03-03 20:32:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:34,133 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1026 transitions. [2025-03-03 20:32:34,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1026 transitions. [2025-03-03 20:32:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:34,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:34,136 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:34,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:32:34,137 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:34,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -767426805, now seen corresponding path program 1 times [2025-03-03 20:32:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001816657] [2025-03-03 20:32:34,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:34,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:34,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001816657] [2025-03-03 20:32:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001816657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:32:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640950828] [2025-03-03 20:32:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:37,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:32:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:37,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:32:37,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:32:37,835 INFO L87 Difference]: Start difference. First operand 709 states and 1026 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:40,228 INFO L93 Difference]: Finished difference Result 1187 states and 1682 transitions. [2025-03-03 20:32:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:32:40,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:40,233 INFO L225 Difference]: With dead ends: 1187 [2025-03-03 20:32:40,233 INFO L226 Difference]: Without dead ends: 1185 [2025-03-03 20:32:40,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2025-03-03 20:32:40,233 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 437 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:40,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 714 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:32:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-03 20:32:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 705. [2025-03-03 20:32:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 606 states have (on average 1.4257425742574257) internal successors, (864), 621 states have internal predecessors, (864), 78 states have call successors, (78), 20 states have call predecessors, (78), 20 states have return successors, (78), 63 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 20:32:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1020 transitions. [2025-03-03 20:32:40,279 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1020 transitions. Word has length 150 [2025-03-03 20:32:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:40,279 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1020 transitions. [2025-03-03 20:32:40,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1020 transitions. [2025-03-03 20:32:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:40,281 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:32:40,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:40,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash 470461674, now seen corresponding path program 1 times [2025-03-03 20:32:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780821231] [2025-03-03 20:32:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:40,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:40,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:40,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:40,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:40,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:40,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780821231] [2025-03-03 20:32:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780821231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:32:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381146399] [2025-03-03 20:32:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:40,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:32:40,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:40,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:32:40,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:32:40,318 INFO L87 Difference]: Start difference. First operand 705 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:40,400 INFO L93 Difference]: Finished difference Result 1893 states and 2717 transitions. [2025-03-03 20:32:40,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:32:40,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:40,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:40,405 INFO L225 Difference]: With dead ends: 1893 [2025-03-03 20:32:40,405 INFO L226 Difference]: Without dead ends: 1183 [2025-03-03 20:32:40,406 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 20:32:40,407 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 102 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:40,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 310 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:32:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-03 20:32:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2025-03-03 20:32:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 984 states have (on average 1.350609756097561) internal successors, (1329), 1014 states have internal predecessors, (1329), 156 states have call successors, (156), 40 states have call predecessors, (156), 40 states have return successors, (156), 126 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 20:32:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1641 transitions. [2025-03-03 20:32:40,477 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1641 transitions. Word has length 150 [2025-03-03 20:32:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:40,478 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1641 transitions. [2025-03-03 20:32:40,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1641 transitions. [2025-03-03 20:32:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:40,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:40,480 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:40,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:32:40,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:40,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1756878856, now seen corresponding path program 1 times [2025-03-03 20:32:40,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:40,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117721273] [2025-03-03 20:32:40,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:40,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:40,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:40,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117721273] [2025-03-03 20:32:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117721273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:32:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943840810] [2025-03-03 20:32:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:44,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:32:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:44,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:32:44,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:32:44,084 INFO L87 Difference]: Start difference. First operand 1181 states and 1641 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 20:32:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:46,769 INFO L93 Difference]: Finished difference Result 3390 states and 4655 transitions. [2025-03-03 20:32:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 20:32:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 150 [2025-03-03 20:32:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:46,776 INFO L225 Difference]: With dead ends: 3390 [2025-03-03 20:32:46,776 INFO L226 Difference]: Without dead ends: 2212 [2025-03-03 20:32:46,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=293, Invalid=577, Unknown=0, NotChecked=0, Total=870 [2025-03-03 20:32:46,778 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1083 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:46,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 748 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:32:46,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2025-03-03 20:32:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 1945. [2025-03-03 20:32:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1600 states have (on average 1.333125) internal successors, (2133), 1649 states have internal predecessors, (2133), 272 states have call successors, (272), 72 states have call predecessors, (272), 72 states have return successors, (272), 223 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-03 20:32:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2677 transitions. [2025-03-03 20:32:46,907 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2677 transitions. Word has length 150 [2025-03-03 20:32:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:46,907 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 2677 transitions. [2025-03-03 20:32:46,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-03 20:32:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2677 transitions. [2025-03-03 20:32:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:46,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:46,909 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:46,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:32:46,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:46,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1463475849, now seen corresponding path program 1 times [2025-03-03 20:32:46,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786970394] [2025-03-03 20:32:46,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:46,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:46,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:46,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:46,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:49,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:49,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786970394] [2025-03-03 20:32:49,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786970394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:49,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:49,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:32:49,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627014638] [2025-03-03 20:32:49,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:49,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:32:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:49,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:32:49,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:32:49,923 INFO L87 Difference]: Start difference. First operand 1945 states and 2677 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:51,440 INFO L93 Difference]: Finished difference Result 3876 states and 5322 transitions. [2025-03-03 20:32:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:32:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:51,448 INFO L225 Difference]: With dead ends: 3876 [2025-03-03 20:32:51,448 INFO L226 Difference]: Without dead ends: 2002 [2025-03-03 20:32:51,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:32:51,451 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 527 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:51,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 694 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:32:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-03-03 20:32:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1925. [2025-03-03 20:32:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1580 states have (on average 1.330379746835443) internal successors, (2102), 1629 states have internal predecessors, (2102), 272 states have call successors, (272), 72 states have call predecessors, (272), 72 states have return successors, (272), 223 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-03 20:32:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2646 transitions. [2025-03-03 20:32:51,606 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2646 transitions. Word has length 150 [2025-03-03 20:32:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:51,606 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2646 transitions. [2025-03-03 20:32:51,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2646 transitions. [2025-03-03 20:32:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:51,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:51,609 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:51,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:32:51,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:51,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash 403569159, now seen corresponding path program 1 times [2025-03-03 20:32:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268001825] [2025-03-03 20:32:51,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:51,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:51,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:51,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:51,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268001825] [2025-03-03 20:32:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268001825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:32:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265908538] [2025-03-03 20:32:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:51,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:32:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:51,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:32:51,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:32:51,672 INFO L87 Difference]: Start difference. First operand 1925 states and 2646 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:51,969 INFO L93 Difference]: Finished difference Result 4133 states and 5665 transitions. [2025-03-03 20:32:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:32:51,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-03 20:32:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:51,978 INFO L225 Difference]: With dead ends: 4133 [2025-03-03 20:32:51,978 INFO L226 Difference]: Without dead ends: 2279 [2025-03-03 20:32:51,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:32:51,982 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 107 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:51,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 447 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:32:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2025-03-03 20:32:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1985. [2025-03-03 20:32:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1639 states have (on average 1.3276388041488714) internal successors, (2176), 1688 states have internal predecessors, (2176), 272 states have call successors, (272), 73 states have call predecessors, (272), 73 states have return successors, (272), 223 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-03 20:32:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2720 transitions. [2025-03-03 20:32:52,122 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2720 transitions. Word has length 150 [2025-03-03 20:32:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:52,123 INFO L471 AbstractCegarLoop]: Abstraction has 1985 states and 2720 transitions. [2025-03-03 20:32:52,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-03 20:32:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2720 transitions. [2025-03-03 20:32:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:32:52,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:52,126 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:52,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:32:52,127 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:52,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1407379125, now seen corresponding path program 1 times [2025-03-03 20:32:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240729062] [2025-03-03 20:32:52,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:52,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:32:52,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:32:52,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:52,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 20:32:52,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:32:52,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240729062] [2025-03-03 20:32:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240729062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:32:52,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:32:52,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:32:52,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990887292] [2025-03-03 20:32:52,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:32:52,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:32:52,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:32:52,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:32:52,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:32:52,323 INFO L87 Difference]: Start difference. First operand 1985 states and 2720 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:32:52,663 INFO L93 Difference]: Finished difference Result 3988 states and 5455 transitions. [2025-03-03 20:32:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:32:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-03 20:32:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:32:52,670 INFO L225 Difference]: With dead ends: 3988 [2025-03-03 20:32:52,670 INFO L226 Difference]: Without dead ends: 1970 [2025-03-03 20:32:52,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:32:52,673 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 207 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:32:52,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 283 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:32:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-03 20:32:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1835. [2025-03-03 20:32:52,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1494 states have (on average 1.3152610441767068) internal successors, (1965), 1541 states have internal predecessors, (1965), 268 states have call successors, (268), 72 states have call predecessors, (268), 72 states have return successors, (268), 221 states have call predecessors, (268), 268 states have call successors, (268) [2025-03-03 20:32:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2501 transitions. [2025-03-03 20:32:52,794 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2501 transitions. Word has length 150 [2025-03-03 20:32:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:32:52,794 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2501 transitions. [2025-03-03 20:32:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:32:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2501 transitions. [2025-03-03 20:32:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 20:32:52,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:32:52,797 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:32:52,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:32:52,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:32:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:32:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1630576440, now seen corresponding path program 1 times [2025-03-03 20:32:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:32:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620786107] [2025-03-03 20:32:52,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:32:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:32:52,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:32:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:52,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:32:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083631238] [2025-03-03 20:32:52,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:32:52,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:32:52,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:32:52,849 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 20:32:52,850 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 20:32:52,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 20:32:52,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 20:32:52,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:32:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:32:52,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 20:32:52,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:32:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 457 proven. 126 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-03-03 20:32:53,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:33:06,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-03-03 20:33:06,349 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-03 20:33:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:33:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620786107] [2025-03-03 20:33:06,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:33:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083631238] [2025-03-03 20:33:06,350 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-03 20:33:06,356 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 20:33:06,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:33:06,554 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-03-03 20:33:06,558 INFO L158 Benchmark]: Toolchain (without parser) took 67260.71ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 112.5MB in the beginning and 557.2MB in the end (delta: -444.7MB). Peak memory consumption was 256.7MB. Max. memory is 16.1GB. [2025-03-03 20:33:06,558 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:33:06,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.63ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:33:06,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.66ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:33:06,559 INFO L158 Benchmark]: Boogie Preprocessor took 28.62ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:33:06,559 INFO L158 Benchmark]: IcfgBuilder took 407.99ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 65.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:33:06,559 INFO L158 Benchmark]: TraceAbstraction took 66507.50ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 65.3MB in the beginning and 557.2MB in the end (delta: -491.9MB). Peak memory consumption was 214.7MB. Max. memory is 16.1GB. [2025-03-03 20:33:06,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.63ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.66ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 94.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.62ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 90.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 407.99ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 65.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 66507.50ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 65.3MB in the beginning and 557.2MB in the end (delta: -491.9MB). Peak memory consumption was 214.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:33:08,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:33:08,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:33:08,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:33:08,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:33:08,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:33:08,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:33:08,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:33:08,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:33:08,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:33:08,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:33:08,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:33:08,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:33:08,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:33:08,332 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:33:08,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:33:08,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:33:08,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:33:08,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:33:08,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:33:08,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:33:08,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:33:08,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:33:08,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:33:08,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:33:08,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:33:08,335 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 -> e9f5cbcd9b5e7070eed068152e26dc672bc2b60288a251274726ceb1bf0c8d9b [2025-03-03 20:33:08,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:33:08,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:33:08,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:33:08,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:33:08,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:33:08,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-03 20:33:09,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ada64cc8/0e7f2750869f45a68dc6906e9fba48a7/FLAGbf8d99853 [2025-03-03 20:33:09,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:33:09,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-03 20:33:09,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ada64cc8/0e7f2750869f45a68dc6906e9fba48a7/FLAGbf8d99853 [2025-03-03 20:33:09,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ada64cc8/0e7f2750869f45a68dc6906e9fba48a7 [2025-03-03 20:33:09,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:33:10,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:33:10,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:33:10,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:33:10,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:33:10,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:33:09" (1/1) ... [2025-03-03 20:33:10,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f2d695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10, skipping insertion in model container [2025-03-03 20:33:10,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:33:09" (1/1) ... [2025-03-03 20:33:10,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:33:10,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i[919,932] [2025-03-03 20:33:10,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:33:10,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:33:10,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i[919,932] [2025-03-03 20:33:10,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:33:10,249 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:33:10,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10 WrapperNode [2025-03-03 20:33:10,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:33:10,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:33:10,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:33:10,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:33:10,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,291 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2025-03-03 20:33:10,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:33:10,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:33:10,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:33:10,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:33:10,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,308 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 20:33:10,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:33:10,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:33:10,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:33:10,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:33:10,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (1/1) ... [2025-03-03 20:33:10,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:33:10,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:33:10,344 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 20:33:10,348 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 20:33:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:33:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:33:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:33:10,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:33:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:33:10,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:33:10,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:33:10,418 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:33:10,757 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:33:10,758 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:33:10,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:33:10,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:33:10,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:33:10 BoogieIcfgContainer [2025-03-03 20:33:10,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:33:10,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:33:10,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:33:10,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:33:10,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:33:09" (1/3) ... [2025-03-03 20:33:10,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55be7cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:33:10, skipping insertion in model container [2025-03-03 20:33:10,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:33:10" (2/3) ... [2025-03-03 20:33:10,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55be7cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:33:10, skipping insertion in model container [2025-03-03 20:33:10,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:33:10" (3/3) ... [2025-03-03 20:33:10,777 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i [2025-03-03 20:33:10,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:33:10,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-66.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:33:10,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:33:10,841 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;@7cfd9dd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:33:10,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:33:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:33:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 20:33:10,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:33:10,854 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:33:10,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:33:10,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:33:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash -62546371, now seen corresponding path program 1 times [2025-03-03 20:33:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:33:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694379139] [2025-03-03 20:33:10,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:33:10,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:33:10,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:33:10,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 20:33:10,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 20:33:11,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 20:33:11,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:33:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:33:11,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:33:11,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:33:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 20:33:11,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:33:11,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:33:11,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694379139] [2025-03-03 20:33:11,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694379139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:33:11,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:33:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:33:11,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492103564] [2025-03-03 20:33:11,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:33:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:33:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:33:11,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:33:11,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:33:11,100 INFO L87 Difference]: Start difference. First operand has 80 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:33:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:33:11,116 INFO L93 Difference]: Finished difference Result 154 states and 269 transitions. [2025-03-03 20:33:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:33:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-03 20:33:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:33:11,122 INFO L225 Difference]: With dead ends: 154 [2025-03-03 20:33:11,122 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 20:33:11,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-03 20:33:11,126 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:33:11,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:33:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 20:33:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 20:33:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:33:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2025-03-03 20:33:11,162 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 149 [2025-03-03 20:33:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:33:11,162 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2025-03-03 20:33:11,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 20:33:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2025-03-03 20:33:11,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 20:33:11,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:33:11,164 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:33:11,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:33:11,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:11,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:33:11,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:33:11,366 INFO L85 PathProgramCache]: Analyzing trace with hash 569304379, now seen corresponding path program 1 times [2025-03-03 20:33:11,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:33:11,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761341582] [2025-03-03 20:33:11,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:33:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:33:11,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:33:11,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 20:33:11,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 20:33:11,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 20:33:11,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:33:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:33:11,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:33:11,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:33:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 548 proven. 75 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 20:33:11,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:33:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 20:33:12,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:33:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761341582] [2025-03-03 20:33:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761341582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:33:12,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:33:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2025-03-03 20:33:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705227934] [2025-03-03 20:33:12,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:33:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:33:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:33:12,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:33:12,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:33:12,168 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 20:33:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:33:12,713 INFO L93 Difference]: Finished difference Result 165 states and 248 transitions. [2025-03-03 20:33:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:33:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 149 [2025-03-03 20:33:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:33:12,719 INFO L225 Difference]: With dead ends: 165 [2025-03-03 20:33:12,719 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 20:33:12,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2025-03-03 20:33:12,720 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 59 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:33:12,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 223 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:33:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 20:33:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-03-03 20:33:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.3) internal successors, (78), 60 states have internal predecessors, (78), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:33:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2025-03-03 20:33:12,730 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 149 [2025-03-03 20:33:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:33:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2025-03-03 20:33:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (37), 3 states have call predecessors, (37), 6 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 20:33:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2025-03-03 20:33:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:33:12,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:33:12,732 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:33:12,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 20:33:12,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:12,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:33:12,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:33:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1618730038, now seen corresponding path program 1 times [2025-03-03 20:33:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:33:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706337899] [2025-03-03 20:33:12,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:33:12,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:12,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:33:12,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:33:12,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 20:33:12,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:33:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:33:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:33:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:33:13,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:33:13,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:33:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 463 proven. 24 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-03 20:33:13,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:33:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-03-03 20:33:13,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:33:13,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706337899] [2025-03-03 20:33:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706337899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:33:13,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:33:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 20:33:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491861662] [2025-03-03 20:33:13,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:33:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:33:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:33:13,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:33:13,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:33:13,342 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:33:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:33:13,600 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2025-03-03 20:33:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:33:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 150 [2025-03-03 20:33:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:33:13,607 INFO L225 Difference]: With dead ends: 181 [2025-03-03 20:33:13,607 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 20:33:13,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:33:13,608 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:33:13,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 210 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:33:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 20:33:13,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2025-03-03 20:33:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 20:33:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2025-03-03 20:33:13,617 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 150 [2025-03-03 20:33:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:33:13,617 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2025-03-03 20:33:13,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 20:33:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2025-03-03 20:33:13,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 20:33:13,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:33:13,618 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:33:13,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 20:33:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:13,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:33:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:33:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash 879285899, now seen corresponding path program 1 times [2025-03-03 20:33:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:33:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604644489] [2025-03-03 20:33:13,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:33:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:33:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:33:13,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:33:13,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 20:33:13,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:33:13,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:33:13,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:33:13,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:33:13,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 20:33:13,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:33:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 546 proven. 114 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 20:33:15,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:33:18,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:33:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604644489] [2025-03-03 20:33:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604644489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:33:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1971852973] [2025-03-03 20:33:18,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:33:18,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 20:33:18,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 20:33:18,812 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 20:33:18,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 20:33:18,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 20:33:19,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 20:33:19,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:33:19,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:33:19,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 20:33:19,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:33:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 514 proven. 69 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-03-03 20:33:22,187 INFO L312 TraceCheckSpWp]: Computing backward predicates...