./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/bitvector/interleave_bits.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:08:08,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:08:08,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:08:08,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:08:08,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:08:08,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:08:08,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:08:08,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:08:08,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:08:08,709 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:08:08,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:08:08,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:08:08,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:08:08,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:08:08,711 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:08:08,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:08:08,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:08:08,711 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:08:08,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:08:08,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:08:08,712 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:08:08,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:08,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:08,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:08:08,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:08:08,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:08:08,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:08:08,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:08:08,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:08:08,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:08:08,714 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-04-30 10:08:08,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:08:08,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:08:08,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:08:08,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:08:08,968 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:08:08,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/interleave_bits.i [2025-04-30 10:08:10,256 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef8b73aa/2d364a7212c44cc89503242ad62a6fc7/FLAG4a28cb4fb [2025-04-30 10:08:10,475 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:08:10,476 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i [2025-04-30 10:08:10,486 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef8b73aa/2d364a7212c44cc89503242ad62a6fc7/FLAG4a28cb4fb [2025-04-30 10:08:11,258 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eef8b73aa/2d364a7212c44cc89503242ad62a6fc7 [2025-04-30 10:08:11,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:08:11,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:08:11,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:08:11,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:08:11,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:08:11,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9f7d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11, skipping insertion in model container [2025-04-30 10:08:11,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:08:11,417 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i[1175,1188] [2025-04-30 10:08:11,451 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:08:11,465 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:08:11,486 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i[1175,1188] [2025-04-30 10:08:11,496 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:08:11,508 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:08:11,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11 WrapperNode [2025-04-30 10:08:11,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:08:11,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:08:11,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:08:11,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:08:11,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,554 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 232 [2025-04-30 10:08:11,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:08:11,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:08:11,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:08:11,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:08:11,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,590 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-04-30 10:08:11,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:08:11,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:08:11,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:08:11,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:08:11,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (1/1) ... [2025-04-30 10:08:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:11,639 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-04-30 10:08:11,642 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-04-30 10:08:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:08:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:08:11,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:08:11,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:08:11,711 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:08:11,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:08:13,006 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-04-30 10:08:13,007 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:08:13,017 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:08:13,018 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:08:13,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:13 BoogieIcfgContainer [2025-04-30 10:08:13,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:08:13,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:08:13,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:08:13,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:08:13,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:08:11" (1/3) ... [2025-04-30 10:08:13,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cde5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:08:13, skipping insertion in model container [2025-04-30 10:08:13,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:11" (2/3) ... [2025-04-30 10:08:13,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cde5dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:08:13, skipping insertion in model container [2025-04-30 10:08:13,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:13" (3/3) ... [2025-04-30 10:08:13,028 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-04-30 10:08:13,039 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:08:13,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 91 locations, 138 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-30 10:08:13,082 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:08:13,091 INFO L340 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;@34e4c5d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:08:13,091 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:08:13,095 INFO L278 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:13,100 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-30 10:08:13,100 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:13,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:13,101 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:13,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:13,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1285029374, now seen corresponding path program 1 times [2025-04-30 10:08:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:13,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861663893] [2025-04-30 10:08:13,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:13,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:08:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:08:13,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:13,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:13,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861663893] [2025-04-30 10:08:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861663893] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:13,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:08:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675637904] [2025-04-30 10:08:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:13,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:08:13,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:13,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:08:13,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:08:13,456 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:13,522 INFO L93 Difference]: Finished difference Result 199 states and 306 transitions. [2025-04-30 10:08:13,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:08:13,524 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-30 10:08:13,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:13,529 INFO L225 Difference]: With dead ends: 199 [2025-04-30 10:08:13,529 INFO L226 Difference]: Without dead ends: 106 [2025-04-30 10:08:13,531 INFO L436 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-04-30 10:08:13,534 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 27 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:13,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 254 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-30 10:08:13,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-04-30 10:08:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 93 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2025-04-30 10:08:13,565 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 31 [2025-04-30 10:08:13,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:13,565 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2025-04-30 10:08:13,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:13,566 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2025-04-30 10:08:13,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-30 10:08:13,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:13,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:13,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:08:13,568 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:13,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash 923415867, now seen corresponding path program 1 times [2025-04-30 10:08:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:13,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595258401] [2025-04-30 10:08:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:13,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:08:13,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:08:13,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:13,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:13,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:13,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595258401] [2025-04-30 10:08:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595258401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:13,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734037718] [2025-04-30 10:08:13,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:13,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:13,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:13,772 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-04-30 10:08:13,775 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-04-30 10:08:13,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-30 10:08:13,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-30 10:08:13,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:13,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:13,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:08:13,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:13,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734037718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:13,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-30 10:08:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663797683] [2025-04-30 10:08:13,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:13,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:08:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:13,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:08:13,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:08:13,925 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:14,009 INFO L93 Difference]: Finished difference Result 236 states and 364 transitions. [2025-04-30 10:08:14,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:08:14,010 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-30 10:08:14,010 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:14,011 INFO L225 Difference]: With dead ends: 236 [2025-04-30 10:08:14,012 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:08:14,012 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:08:14,013 INFO L437 NwaCegarLoop]: 144 mSDtfsCounter, 157 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:14,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 628 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:08:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-04-30 10:08:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.52) internal successors, (228), 150 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2025-04-30 10:08:14,020 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 41 [2025-04-30 10:08:14,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:14,021 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2025-04-30 10:08:14,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:14,021 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2025-04-30 10:08:14,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-30 10:08:14,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:14,022 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:14,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:14,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:14,226 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:14,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1475458010, now seen corresponding path program 1 times [2025-04-30 10:08:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:14,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809018756] [2025-04-30 10:08:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:14,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-30 10:08:14,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-30 10:08:14,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:14,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:08:14,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:14,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809018756] [2025-04-30 10:08:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809018756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:14,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34301547] [2025-04-30 10:08:14,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:14,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:14,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:14,471 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-04-30 10:08:14,472 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-04-30 10:08:14,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-30 10:08:14,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-30 10:08:14,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:14,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:14,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:08:14,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:08:14,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-30 10:08:14,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34301547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:14,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:14,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:08:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734979313] [2025-04-30 10:08:14,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:14,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:08:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:08:14,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:08:14,680 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:14,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:14,773 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2025-04-30 10:08:14,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:08:14,773 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-04-30 10:08:14,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:14,774 INFO L225 Difference]: With dead ends: 256 [2025-04-30 10:08:14,774 INFO L226 Difference]: Without dead ends: 151 [2025-04-30 10:08:14,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:14,775 INFO L437 NwaCegarLoop]: 167 mSDtfsCounter, 290 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:14,775 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 599 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-04-30 10:08:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-04-30 10:08:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:14,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2025-04-30 10:08:14,785 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 75 [2025-04-30 10:08:14,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:14,785 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2025-04-30 10:08:14,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:14,785 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2025-04-30 10:08:14,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-30 10:08:14,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:14,786 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:14,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:08:14,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-30 10:08:14,987 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:14,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 228491398, now seen corresponding path program 2 times [2025-04-30 10:08:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:14,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625964215] [2025-04-30 10:08:14,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:14,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-30 10:08:15,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:08:15,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:15,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:15,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625964215] [2025-04-30 10:08:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625964215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:15,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40239032] [2025-04-30 10:08:15,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:15,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:15,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:15,205 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-04-30 10:08:15,207 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-04-30 10:08:15,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-04-30 10:08:15,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-04-30 10:08:15,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:15,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:15,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:08:15,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:15,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:15,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40239032] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:15,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:15,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-30 10:08:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139455906] [2025-04-30 10:08:15,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:15,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-30 10:08:15,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:15,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-30 10:08:15,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-04-30 10:08:15,459 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:15,730 INFO L93 Difference]: Finished difference Result 346 states and 518 transitions. [2025-04-30 10:08:15,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:08:15,730 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-04-30 10:08:15,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:15,731 INFO L225 Difference]: With dead ends: 346 [2025-04-30 10:08:15,731 INFO L226 Difference]: Without dead ends: 283 [2025-04-30 10:08:15,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:15,732 INFO L437 NwaCegarLoop]: 216 mSDtfsCounter, 699 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:15,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1386 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:08:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-04-30 10:08:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-04-30 10:08:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.475177304964539) internal successors, (416), 282 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2025-04-30 10:08:15,747 INFO L79 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 77 [2025-04-30 10:08:15,748 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:15,748 INFO L485 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2025-04-30 10:08:15,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:15,748 INFO L278 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2025-04-30 10:08:15,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-04-30 10:08:15,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:15,750 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:15,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:15,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:15,954 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:15,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:15,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1192376988, now seen corresponding path program 3 times [2025-04-30 10:08:15,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:15,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46893268] [2025-04-30 10:08:15,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:08:15,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:15,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 11 equivalence classes. [2025-04-30 10:08:15,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 149 statements. [2025-04-30 10:08:15,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:08:15,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-04-30 10:08:16,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:16,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46893268] [2025-04-30 10:08:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46893268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-30 10:08:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720361599] [2025-04-30 10:08:16,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:16,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:08:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:16,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:08:16,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:16,293 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:16,521 INFO L93 Difference]: Finished difference Result 883 states and 1346 transitions. [2025-04-30 10:08:16,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:08:16,522 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-04-30 10:08:16,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:16,526 INFO L225 Difference]: With dead ends: 883 [2025-04-30 10:08:16,526 INFO L226 Difference]: Without dead ends: 611 [2025-04-30 10:08:16,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:08:16,528 INFO L437 NwaCegarLoop]: 120 mSDtfsCounter, 108 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:16,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1136 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:08:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-04-30 10:08:16,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 604. [2025-04-30 10:08:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4378109452736318) internal successors, (867), 603 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 867 transitions. [2025-04-30 10:08:16,564 INFO L79 Accepts]: Start accepts. Automaton has 604 states and 867 transitions. Word has length 149 [2025-04-30 10:08:16,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:16,564 INFO L485 AbstractCegarLoop]: Abstraction has 604 states and 867 transitions. [2025-04-30 10:08:16,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:16,564 INFO L278 IsEmpty]: Start isEmpty. Operand 604 states and 867 transitions. [2025-04-30 10:08:16,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-04-30 10:08:16,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:16,567 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:16,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:08:16,567 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:16,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1689323591, now seen corresponding path program 1 times [2025-04-30 10:08:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:16,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254886874] [2025-04-30 10:08:16,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:16,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:16,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:16,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:16,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:17,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254886874] [2025-04-30 10:08:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254886874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:17,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244813792] [2025-04-30 10:08:17,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:17,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:17,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:17,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:08:17,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:17,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:17,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:17,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:08:17,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-04-30 10:08:17,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-04-30 10:08:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244813792] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2025-04-30 10:08:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105985300] [2025-04-30 10:08:17,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:17,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:17,222 INFO L87 Difference]: Start difference. First operand 604 states and 867 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:17,492 INFO L93 Difference]: Finished difference Result 669 states and 964 transitions. [2025-04-30 10:08:17,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:17,492 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-04-30 10:08:17,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:17,495 INFO L225 Difference]: With dead ends: 669 [2025-04-30 10:08:17,495 INFO L226 Difference]: Without dead ends: 660 [2025-04-30 10:08:17,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:17,498 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 32 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:17,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 361 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:08:17,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-04-30 10:08:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-04-30 10:08:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.4461305007587253) internal successors, (953), 659 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 953 transitions. [2025-04-30 10:08:17,517 INFO L79 Accepts]: Start accepts. Automaton has 660 states and 953 transitions. Word has length 150 [2025-04-30 10:08:17,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:17,518 INFO L485 AbstractCegarLoop]: Abstraction has 660 states and 953 transitions. [2025-04-30 10:08:17,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:17,518 INFO L278 IsEmpty]: Start isEmpty. Operand 660 states and 953 transitions. [2025-04-30 10:08:17,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-04-30 10:08:17,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:17,520 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:17,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:08:17,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:17,725 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:17,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:17,725 INFO L85 PathProgramCache]: Analyzing trace with hash -62228544, now seen corresponding path program 1 times [2025-04-30 10:08:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:17,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988437538] [2025-04-30 10:08:17,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:17,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:17,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:17,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:17,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:18,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:18,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988437538] [2025-04-30 10:08:18,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988437538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:18,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096764895] [2025-04-30 10:08:18,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:18,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:18,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:18,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:18,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:08:18,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:18,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:18,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:18,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:08:18,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-04-30 10:08:18,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-04-30 10:08:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096764895] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:18,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-04-30 10:08:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824705303] [2025-04-30 10:08:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:18,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:18,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:18,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:08:18,305 INFO L87 Difference]: Start difference. First operand 660 states and 953 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:18,383 INFO L93 Difference]: Finished difference Result 701 states and 1011 transitions. [2025-04-30 10:08:18,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:18,384 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-04-30 10:08:18,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:18,386 INFO L225 Difference]: With dead ends: 701 [2025-04-30 10:08:18,386 INFO L226 Difference]: Without dead ends: 675 [2025-04-30 10:08:18,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:08:18,387 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:18,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-04-30 10:08:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-04-30 10:08:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.4391691394658754) internal successors, (970), 674 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 970 transitions. [2025-04-30 10:08:18,401 INFO L79 Accepts]: Start accepts. Automaton has 675 states and 970 transitions. Word has length 150 [2025-04-30 10:08:18,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:18,402 INFO L485 AbstractCegarLoop]: Abstraction has 675 states and 970 transitions. [2025-04-30 10:08:18,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:18,402 INFO L278 IsEmpty]: Start isEmpty. Operand 675 states and 970 transitions. [2025-04-30 10:08:18,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-04-30 10:08:18,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:18,403 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:18,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:18,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:18,604 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:18,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1550195962, now seen corresponding path program 1 times [2025-04-30 10:08:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:18,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134470090] [2025-04-30 10:08:18,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:18,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-04-30 10:08:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:18,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134470090] [2025-04-30 10:08:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134470090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:18,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:18,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:18,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637930630] [2025-04-30 10:08:18,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:18,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:18,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:18,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:18,776 INFO L87 Difference]: Start difference. First operand 675 states and 970 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:18,801 INFO L93 Difference]: Finished difference Result 1532 states and 2225 transitions. [2025-04-30 10:08:18,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:18,802 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-04-30 10:08:18,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:18,804 INFO L225 Difference]: With dead ends: 1532 [2025-04-30 10:08:18,805 INFO L226 Difference]: Without dead ends: 883 [2025-04-30 10:08:18,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:18,807 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 7 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:18,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 381 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-04-30 10:08:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-04-30 10:08:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4002267573696145) internal successors, (1235), 882 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1235 transitions. [2025-04-30 10:08:18,828 INFO L79 Accepts]: Start accepts. Automaton has 883 states and 1235 transitions. Word has length 150 [2025-04-30 10:08:18,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:18,828 INFO L485 AbstractCegarLoop]: Abstraction has 883 states and 1235 transitions. [2025-04-30 10:08:18,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:18,828 INFO L278 IsEmpty]: Start isEmpty. Operand 883 states and 1235 transitions. [2025-04-30 10:08:18,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-04-30 10:08:18,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:18,830 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:18,830 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:08:18,830 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:18,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1756521535, now seen corresponding path program 1 times [2025-04-30 10:08:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:18,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380356230] [2025-04-30 10:08:18,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:18,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:18,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:18,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:18,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:18,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-04-30 10:08:19,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:19,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380356230] [2025-04-30 10:08:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380356230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:19,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179028483] [2025-04-30 10:08:19,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:19,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:19,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:19,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:19,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:08:19,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:08:19,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:08:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:19,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:08:19,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-04-30 10:08:19,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-04-30 10:08:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179028483] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:19,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-04-30 10:08:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022570350] [2025-04-30 10:08:19,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:19,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:08:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:19,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:08:19,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:19,572 INFO L87 Difference]: Start difference. First operand 883 states and 1235 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:19,682 INFO L93 Difference]: Finished difference Result 2078 states and 2877 transitions. [2025-04-30 10:08:19,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:08:19,682 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-04-30 10:08:19,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:19,688 INFO L225 Difference]: With dead ends: 2078 [2025-04-30 10:08:19,688 INFO L226 Difference]: Without dead ends: 1294 [2025-04-30 10:08:19,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:19,690 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 82 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:19,690 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 799 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-04-30 10:08:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-04-30 10:08:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 1.3418406805877803) internal successors, (1735), 1293 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1735 transitions. [2025-04-30 10:08:19,714 INFO L79 Accepts]: Start accepts. Automaton has 1294 states and 1735 transitions. Word has length 150 [2025-04-30 10:08:19,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:19,714 INFO L485 AbstractCegarLoop]: Abstraction has 1294 states and 1735 transitions. [2025-04-30 10:08:19,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:19,714 INFO L278 IsEmpty]: Start isEmpty. Operand 1294 states and 1735 transitions. [2025-04-30 10:08:19,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-04-30 10:08:19,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:19,717 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:19,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:19,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:19,921 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:19,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1834012885, now seen corresponding path program 1 times [2025-04-30 10:08:19,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:19,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025298230] [2025-04-30 10:08:19,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:19,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-04-30 10:08:19,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:19,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:19,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:20,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:20,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025298230] [2025-04-30 10:08:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025298230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:20,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047112998] [2025-04-30 10:08:20,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:20,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:20,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:20,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:20,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:08:20,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-04-30 10:08:20,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:20,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:20,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:20,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:08:20,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-04-30 10:08:20,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-04-30 10:08:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047112998] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:20,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:20,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-04-30 10:08:20,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821727514] [2025-04-30 10:08:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:20,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:20,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:20,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:20,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:08:20,384 INFO L87 Difference]: Start difference. First operand 1294 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:20,442 INFO L93 Difference]: Finished difference Result 1446 states and 1961 transitions. [2025-04-30 10:08:20,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:20,442 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-04-30 10:08:20,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:20,446 INFO L225 Difference]: With dead ends: 1446 [2025-04-30 10:08:20,446 INFO L226 Difference]: Without dead ends: 1302 [2025-04-30 10:08:20,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:08:20,447 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:20,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-04-30 10:08:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2025-04-30 10:08:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1301 states have (on average 1.3412759415833975) internal successors, (1745), 1301 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1745 transitions. [2025-04-30 10:08:20,470 INFO L79 Accepts]: Start accepts. Automaton has 1302 states and 1745 transitions. Word has length 151 [2025-04-30 10:08:20,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:20,470 INFO L485 AbstractCegarLoop]: Abstraction has 1302 states and 1745 transitions. [2025-04-30 10:08:20,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:20,470 INFO L278 IsEmpty]: Start isEmpty. Operand 1302 states and 1745 transitions. [2025-04-30 10:08:20,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-04-30 10:08:20,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:20,473 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:20,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:20,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:20,673 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:20,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:20,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1731789058, now seen corresponding path program 1 times [2025-04-30 10:08:20,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:20,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323032228] [2025-04-30 10:08:20,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:20,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-04-30 10:08:20,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:20,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323032228] [2025-04-30 10:08:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323032228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:20,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383577557] [2025-04-30 10:08:20,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:20,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:20,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:20,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:20,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:08:20,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-04-30 10:08:21,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:21,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:21,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:21,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:08:21,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-04-30 10:08:21,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-04-30 10:08:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383577557] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:21,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-04-30 10:08:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830691346] [2025-04-30 10:08:21,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:21,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:21,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:21,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:21,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:08:21,121 INFO L87 Difference]: Start difference. First operand 1302 states and 1745 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:21,189 INFO L93 Difference]: Finished difference Result 1323 states and 1772 transitions. [2025-04-30 10:08:21,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:21,189 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-04-30 10:08:21,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:21,193 INFO L225 Difference]: With dead ends: 1323 [2025-04-30 10:08:21,193 INFO L226 Difference]: Without dead ends: 1296 [2025-04-30 10:08:21,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:08:21,194 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:21,194 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-04-30 10:08:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-04-30 10:08:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 1.3397683397683398) internal successors, (1735), 1295 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1735 transitions. [2025-04-30 10:08:21,216 INFO L79 Accepts]: Start accepts. Automaton has 1296 states and 1735 transitions. Word has length 151 [2025-04-30 10:08:21,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:21,217 INFO L485 AbstractCegarLoop]: Abstraction has 1296 states and 1735 transitions. [2025-04-30 10:08:21,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:21,217 INFO L278 IsEmpty]: Start isEmpty. Operand 1296 states and 1735 transitions. [2025-04-30 10:08:21,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-04-30 10:08:21,219 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:21,219 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:21,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:21,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:08:21,420 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:21,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1656348823, now seen corresponding path program 1 times [2025-04-30 10:08:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:21,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678312887] [2025-04-30 10:08:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:21,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-04-30 10:08:21,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:21,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:21,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 99 proven. 9 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-04-30 10:08:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:21,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678312887] [2025-04-30 10:08:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678312887] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:21,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69615511] [2025-04-30 10:08:21,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:21,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:21,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:21,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:21,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:08:21,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-04-30 10:08:21,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:21,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:21,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:21,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:08:21,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 99 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-04-30 10:08:21,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-04-30 10:08:22,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69615511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:22,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:22,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-04-30 10:08:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114292139] [2025-04-30 10:08:22,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:22,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:08:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:22,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:08:22,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:22,021 INFO L87 Difference]: Start difference. First operand 1296 states and 1735 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:22,119 INFO L93 Difference]: Finished difference Result 2955 states and 3917 transitions. [2025-04-30 10:08:22,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:08:22,120 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-04-30 10:08:22,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:22,125 INFO L225 Difference]: With dead ends: 2955 [2025-04-30 10:08:22,125 INFO L226 Difference]: Without dead ends: 1745 [2025-04-30 10:08:22,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:22,127 INFO L437 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:22,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 755 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-04-30 10:08:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2025-04-30 10:08:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1744 states have (on average 1.2987385321100917) internal successors, (2265), 1744 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2265 transitions. [2025-04-30 10:08:22,169 INFO L79 Accepts]: Start accepts. Automaton has 1745 states and 2265 transitions. Word has length 151 [2025-04-30 10:08:22,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:22,170 INFO L485 AbstractCegarLoop]: Abstraction has 1745 states and 2265 transitions. [2025-04-30 10:08:22,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:22,170 INFO L278 IsEmpty]: Start isEmpty. Operand 1745 states and 2265 transitions. [2025-04-30 10:08:22,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-04-30 10:08:22,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:22,173 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:22,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:22,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:22,378 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:22,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1257459686, now seen corresponding path program 2 times [2025-04-30 10:08:22,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:22,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728964949] [2025-04-30 10:08:22,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:22,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-04-30 10:08:22,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:22,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:22,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:22,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728964949] [2025-04-30 10:08:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728964949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:22,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116673918] [2025-04-30 10:08:22,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:22,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:22,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:08:22,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-04-30 10:08:22,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-04-30 10:08:22,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:22,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:22,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:08:22,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 44 proven. 65 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-04-30 10:08:23,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 8 proven. 101 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-04-30 10:08:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116673918] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:23,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:23,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 37 [2025-04-30 10:08:23,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878042584] [2025-04-30 10:08:23,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:23,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-30 10:08:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:23,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-30 10:08:23,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1192, Unknown=0, NotChecked=0, Total=1332 [2025-04-30 10:08:23,632 INFO L87 Difference]: Start difference. First operand 1745 states and 2265 transitions. Second operand has 37 states, 37 states have (on average 6.54054054054054) internal successors, (242), 37 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:30,752 INFO L93 Difference]: Finished difference Result 5762 states and 7809 transitions. [2025-04-30 10:08:30,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2025-04-30 10:08:30,753 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 6.54054054054054) internal successors, (242), 37 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-04-30 10:08:30,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:30,764 INFO L225 Difference]: With dead ends: 5762 [2025-04-30 10:08:30,764 INFO L226 Difference]: Without dead ends: 4622 [2025-04-30 10:08:30,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55054 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7332, Invalid=120474, Unknown=0, NotChecked=0, Total=127806 [2025-04-30 10:08:30,778 INFO L437 NwaCegarLoop]: 258 mSDtfsCounter, 3557 mSDsluCounter, 5323 mSDsCounter, 0 mSdLazyCounter, 4639 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3557 SdHoareTripleChecker+Valid, 5581 SdHoareTripleChecker+Invalid, 4900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 4639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:30,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3557 Valid, 5581 Invalid, 4900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 4639 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-30 10:08:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2025-04-30 10:08:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 2246. [2025-04-30 10:08:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2245 states have (on average 1.311358574610245) internal successors, (2944), 2245 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2944 transitions. [2025-04-30 10:08:30,824 INFO L79 Accepts]: Start accepts. Automaton has 2246 states and 2944 transitions. Word has length 151 [2025-04-30 10:08:30,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:30,824 INFO L485 AbstractCegarLoop]: Abstraction has 2246 states and 2944 transitions. [2025-04-30 10:08:30,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.54054054054054) internal successors, (242), 37 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:30,825 INFO L278 IsEmpty]: Start isEmpty. Operand 2246 states and 2944 transitions. [2025-04-30 10:08:30,828 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-04-30 10:08:30,828 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:30,828 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:30,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-30 10:08:31,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:08:31,029 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:31,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1045486752, now seen corresponding path program 1 times [2025-04-30 10:08:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:31,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427842867] [2025-04-30 10:08:31,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:31,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:08:31,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:08:31,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:31,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427842867] [2025-04-30 10:08:31,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427842867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:31,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774639967] [2025-04-30 10:08:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:31,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:31,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:31,308 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:31,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:08:31,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:08:31,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:08:31,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:31,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:31,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:08:31,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-04-30 10:08:31,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-04-30 10:08:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774639967] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:31,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 20 [2025-04-30 10:08:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456359780] [2025-04-30 10:08:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:31,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:31,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:31,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:31,456 INFO L87 Difference]: Start difference. First operand 2246 states and 2944 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:31,548 INFO L93 Difference]: Finished difference Result 2324 states and 3053 transitions. [2025-04-30 10:08:31,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:31,548 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-04-30 10:08:31,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:31,553 INFO L225 Difference]: With dead ends: 2324 [2025-04-30 10:08:31,553 INFO L226 Difference]: Without dead ends: 2261 [2025-04-30 10:08:31,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:31,554 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:31,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-04-30 10:08:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2025-04-30 10:08:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.3101769911504424) internal successors, (2961), 2260 states have internal predecessors, (2961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2961 transitions. [2025-04-30 10:08:31,609 INFO L79 Accepts]: Start accepts. Automaton has 2261 states and 2961 transitions. Word has length 164 [2025-04-30 10:08:31,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:31,609 INFO L485 AbstractCegarLoop]: Abstraction has 2261 states and 2961 transitions. [2025-04-30 10:08:31,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:31,609 INFO L278 IsEmpty]: Start isEmpty. Operand 2261 states and 2961 transitions. [2025-04-30 10:08:31,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-04-30 10:08:31,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:31,613 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:31,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:31,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:08:31,818 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:31,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1494912858, now seen corresponding path program 1 times [2025-04-30 10:08:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:31,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375062484] [2025-04-30 10:08:31,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:31,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:31,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:08:31,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:08:31,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:31,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:32,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:32,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375062484] [2025-04-30 10:08:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375062484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:32,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156308723] [2025-04-30 10:08:32,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:32,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:32,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:32,076 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:32,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-30 10:08:32,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-30 10:08:32,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:08:32,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:32,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:32,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:08:32,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-04-30 10:08:32,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156308723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:32,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:32,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-04-30 10:08:32,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618017674] [2025-04-30 10:08:32,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:32,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:32,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:32,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:32,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:32,219 INFO L87 Difference]: Start difference. First operand 2261 states and 2961 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:32,778 INFO L93 Difference]: Finished difference Result 2428 states and 3200 transitions. [2025-04-30 10:08:32,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:32,779 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-04-30 10:08:32,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:32,784 INFO L225 Difference]: With dead ends: 2428 [2025-04-30 10:08:32,784 INFO L226 Difference]: Without dead ends: 2257 [2025-04-30 10:08:32,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:32,785 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:32,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-30 10:08:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-04-30 10:08:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-04-30 10:08:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.30895390070922) internal successors, (2953), 2256 states have internal predecessors, (2953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 2953 transitions. [2025-04-30 10:08:32,830 INFO L79 Accepts]: Start accepts. Automaton has 2257 states and 2953 transitions. Word has length 164 [2025-04-30 10:08:32,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:32,830 INFO L485 AbstractCegarLoop]: Abstraction has 2257 states and 2953 transitions. [2025-04-30 10:08:32,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:32,830 INFO L278 IsEmpty]: Start isEmpty. Operand 2257 states and 2953 transitions. [2025-04-30 10:08:32,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-04-30 10:08:32,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:32,835 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:32,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-30 10:08:33,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:08:33,039 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:33,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -320339281, now seen corresponding path program 2 times [2025-04-30 10:08:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:33,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086192197] [2025-04-30 10:08:33,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:33,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:08:33,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:08:33,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:33,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:33,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:33,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086192197] [2025-04-30 10:08:33,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086192197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:33,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119866321] [2025-04-30 10:08:33,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:33,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:33,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:33,308 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:33,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-30 10:08:33,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:08:33,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:08:33,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:33,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:33,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:08:33,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-04-30 10:08:33,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119866321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-04-30 10:08:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030779641] [2025-04-30 10:08:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:33,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:33,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:33,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:33,451 INFO L87 Difference]: Start difference. First operand 2257 states and 2953 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:33,520 INFO L93 Difference]: Finished difference Result 4006 states and 5387 transitions. [2025-04-30 10:08:33,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:33,521 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2025-04-30 10:08:33,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:33,526 INFO L225 Difference]: With dead ends: 4006 [2025-04-30 10:08:33,526 INFO L226 Difference]: Without dead ends: 2619 [2025-04-30 10:08:33,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:08:33,528 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:33,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 417 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2025-04-30 10:08:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2297. [2025-04-30 10:08:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2297 states, 2296 states have (on average 1.3209930313588851) internal successors, (3033), 2296 states have internal predecessors, (3033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3033 transitions. [2025-04-30 10:08:33,558 INFO L79 Accepts]: Start accepts. Automaton has 2297 states and 3033 transitions. Word has length 164 [2025-04-30 10:08:33,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:33,558 INFO L485 AbstractCegarLoop]: Abstraction has 2297 states and 3033 transitions. [2025-04-30 10:08:33,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:33,558 INFO L278 IsEmpty]: Start isEmpty. Operand 2297 states and 3033 transitions. [2025-04-30 10:08:33,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-04-30 10:08:33,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:33,562 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:33,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-30 10:08:33,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:08:33,762 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:33,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 483246677, now seen corresponding path program 1 times [2025-04-30 10:08:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:33,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958525740] [2025-04-30 10:08:33,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:33,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:33,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:08:33,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:08:33,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:33,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:34,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958525740] [2025-04-30 10:08:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958525740] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:34,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439761570] [2025-04-30 10:08:34,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:34,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:34,009 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-30 10:08:34,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:08:34,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:08:34,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:34,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:08:34,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-04-30 10:08:34,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:34,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439761570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:34,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:34,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-04-30 10:08:34,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733892459] [2025-04-30 10:08:34,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:34,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:34,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:34,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:34,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:34,123 INFO L87 Difference]: Start difference. First operand 2297 states and 3033 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:34,220 INFO L93 Difference]: Finished difference Result 2355 states and 3111 transitions. [2025-04-30 10:08:34,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:34,220 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-04-30 10:08:34,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:34,225 INFO L225 Difference]: With dead ends: 2355 [2025-04-30 10:08:34,225 INFO L226 Difference]: Without dead ends: 2291 [2025-04-30 10:08:34,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:08:34,226 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:34,226 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-04-30 10:08:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2025-04-30 10:08:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 2290 states have (on average 1.3200873362445416) internal successors, (3023), 2290 states have internal predecessors, (3023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3023 transitions. [2025-04-30 10:08:34,269 INFO L79 Accepts]: Start accepts. Automaton has 2291 states and 3023 transitions. Word has length 165 [2025-04-30 10:08:34,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:34,270 INFO L485 AbstractCegarLoop]: Abstraction has 2291 states and 3023 transitions. [2025-04-30 10:08:34,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:34,270 INFO L278 IsEmpty]: Start isEmpty. Operand 2291 states and 3023 transitions. [2025-04-30 10:08:34,273 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-04-30 10:08:34,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:34,274 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:34,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-30 10:08:34,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:34,478 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:34,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2025980555, now seen corresponding path program 1 times [2025-04-30 10:08:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:34,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999290116] [2025-04-30 10:08:34,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:34,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:08:34,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:08:34,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:34,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:34,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999290116] [2025-04-30 10:08:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999290116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:34,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334901433] [2025-04-30 10:08:34,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:34,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:34,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:34,712 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:34,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-30 10:08:34,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:08:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:08:34,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:34,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:34,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:08:34,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-04-30 10:08:34,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-04-30 10:08:34,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334901433] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:34,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:34,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 6] total 20 [2025-04-30 10:08:34,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514228602] [2025-04-30 10:08:34,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:34,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:34,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:34,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:34,878 INFO L87 Difference]: Start difference. First operand 2291 states and 3023 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:34,959 INFO L93 Difference]: Finished difference Result 2512 states and 3340 transitions. [2025-04-30 10:08:34,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:34,959 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-04-30 10:08:34,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:34,964 INFO L225 Difference]: With dead ends: 2512 [2025-04-30 10:08:34,964 INFO L226 Difference]: Without dead ends: 2307 [2025-04-30 10:08:34,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:08:34,965 INFO L437 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:34,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-04-30 10:08:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-04-30 10:08:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3196010407632264) internal successors, (3043), 2306 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3043 transitions. [2025-04-30 10:08:35,001 INFO L79 Accepts]: Start accepts. Automaton has 2307 states and 3043 transitions. Word has length 165 [2025-04-30 10:08:35,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:35,001 INFO L485 AbstractCegarLoop]: Abstraction has 2307 states and 3043 transitions. [2025-04-30 10:08:35,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:35,001 INFO L278 IsEmpty]: Start isEmpty. Operand 2307 states and 3043 transitions. [2025-04-30 10:08:35,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-04-30 10:08:35,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:35,005 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:35,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:35,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-30 10:08:35,205 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:35,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash -614213078, now seen corresponding path program 1 times [2025-04-30 10:08:35,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:35,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289522047] [2025-04-30 10:08:35,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:35,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:08:35,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:08:35,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:35,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:35,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289522047] [2025-04-30 10:08:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289522047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:35,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947038030] [2025-04-30 10:08:35,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:35,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:35,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:35,426 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:35,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-30 10:08:35,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:08:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:08:35,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:35,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:35,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-30 10:08:35,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:35,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947038030] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:35,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:35,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-04-30 10:08:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658985753] [2025-04-30 10:08:35,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:35,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-30 10:08:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:35,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-30 10:08:35,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-04-30 10:08:35,933 INFO L87 Difference]: Start difference. First operand 2307 states and 3043 transitions. Second operand has 27 states, 27 states have (on average 11.222222222222221) internal successors, (303), 27 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:36,360 INFO L93 Difference]: Finished difference Result 3642 states and 4866 transitions. [2025-04-30 10:08:36,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-30 10:08:36,361 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.222222222222221) internal successors, (303), 27 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-04-30 10:08:36,361 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:36,368 INFO L225 Difference]: With dead ends: 3642 [2025-04-30 10:08:36,368 INFO L226 Difference]: Without dead ends: 3357 [2025-04-30 10:08:36,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=629, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:08:36,369 INFO L437 NwaCegarLoop]: 380 mSDtfsCounter, 987 mSDsluCounter, 4642 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 5022 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:36,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 5022 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:08:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2025-04-30 10:08:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 3287. [2025-04-30 10:08:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 3286 states have (on average 1.3125380401704199) internal successors, (4313), 3286 states have internal predecessors, (4313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4313 transitions. [2025-04-30 10:08:36,408 INFO L79 Accepts]: Start accepts. Automaton has 3287 states and 4313 transitions. Word has length 165 [2025-04-30 10:08:36,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:36,408 INFO L485 AbstractCegarLoop]: Abstraction has 3287 states and 4313 transitions. [2025-04-30 10:08:36,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.222222222222221) internal successors, (303), 27 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:36,408 INFO L278 IsEmpty]: Start isEmpty. Operand 3287 states and 4313 transitions. [2025-04-30 10:08:36,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-04-30 10:08:36,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:36,413 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:36,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:36,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:36,614 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:36,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash 43431015, now seen corresponding path program 2 times [2025-04-30 10:08:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:36,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164143158] [2025-04-30 10:08:36,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:36,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-04-30 10:08:36,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 225 of 225 statements. [2025-04-30 10:08:36,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:36,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2025-04-30 10:08:36,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:36,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164143158] [2025-04-30 10:08:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164143158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:36,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:36,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075429368] [2025-04-30 10:08:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:36,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:36,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:36,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:36,995 INFO L87 Difference]: Start difference. First operand 3287 states and 4313 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:37,085 INFO L93 Difference]: Finished difference Result 4447 states and 5760 transitions. [2025-04-30 10:08:37,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:37,085 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-04-30 10:08:37,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:37,093 INFO L225 Difference]: With dead ends: 4447 [2025-04-30 10:08:37,093 INFO L226 Difference]: Without dead ends: 4058 [2025-04-30 10:08:37,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:37,095 INFO L437 NwaCegarLoop]: 190 mSDtfsCounter, 48 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:37,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 471 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2025-04-30 10:08:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4037. [2025-04-30 10:08:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4037 states, 4036 states have (on average 1.2926164519326064) internal successors, (5217), 4036 states have internal predecessors, (5217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 4037 states and 5217 transitions. [2025-04-30 10:08:37,151 INFO L79 Accepts]: Start accepts. Automaton has 4037 states and 5217 transitions. Word has length 225 [2025-04-30 10:08:37,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:37,152 INFO L485 AbstractCegarLoop]: Abstraction has 4037 states and 5217 transitions. [2025-04-30 10:08:37,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:37,152 INFO L278 IsEmpty]: Start isEmpty. Operand 4037 states and 5217 transitions. [2025-04-30 10:08:37,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-04-30 10:08:37,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:37,156 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:37,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:08:37,157 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:37,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 946758477, now seen corresponding path program 1 times [2025-04-30 10:08:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:37,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752306722] [2025-04-30 10:08:37,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:37,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-04-30 10:08:37,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-04-30 10:08:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-04-30 10:08:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:37,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752306722] [2025-04-30 10:08:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752306722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:37,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:37,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:08:37,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247641378] [2025-04-30 10:08:37,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:37,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:08:37,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:37,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:08:37,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:08:37,568 INFO L87 Difference]: Start difference. First operand 4037 states and 5217 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:37,656 INFO L93 Difference]: Finished difference Result 7594 states and 9864 transitions. [2025-04-30 10:08:37,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:08:37,656 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-04-30 10:08:37,656 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:37,663 INFO L225 Difference]: With dead ends: 7594 [2025-04-30 10:08:37,663 INFO L226 Difference]: Without dead ends: 4384 [2025-04-30 10:08:37,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:08:37,666 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 50 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:37,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 685 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2025-04-30 10:08:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 4132. [2025-04-30 10:08:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 4131 states have (on average 1.271604938271605) internal successors, (5253), 4131 states have internal predecessors, (5253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 5253 transitions. [2025-04-30 10:08:37,711 INFO L79 Accepts]: Start accepts. Automaton has 4132 states and 5253 transitions. Word has length 225 [2025-04-30 10:08:37,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:37,711 INFO L485 AbstractCegarLoop]: Abstraction has 4132 states and 5253 transitions. [2025-04-30 10:08:37,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:37,711 INFO L278 IsEmpty]: Start isEmpty. Operand 4132 states and 5253 transitions. [2025-04-30 10:08:37,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-04-30 10:08:37,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:37,716 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:37,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:08:37,716 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:37,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1442470486, now seen corresponding path program 1 times [2025-04-30 10:08:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:37,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261148047] [2025-04-30 10:08:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:37,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-04-30 10:08:37,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-04-30 10:08:37,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:37,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-04-30 10:08:37,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:37,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261148047] [2025-04-30 10:08:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261148047] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:08:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192889971] [2025-04-30 10:08:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:37,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:37,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:37,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:37,942 INFO L87 Difference]: Start difference. First operand 4132 states and 5253 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:38,048 INFO L93 Difference]: Finished difference Result 4247 states and 5413 transitions. [2025-04-30 10:08:38,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:38,048 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-04-30 10:08:38,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:38,054 INFO L225 Difference]: With dead ends: 4247 [2025-04-30 10:08:38,054 INFO L226 Difference]: Without dead ends: 4141 [2025-04-30 10:08:38,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:38,056 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:38,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2025-04-30 10:08:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4141. [2025-04-30 10:08:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 4140 states have (on average 1.2705314009661837) internal successors, (5260), 4140 states have internal predecessors, (5260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 5260 transitions. [2025-04-30 10:08:38,099 INFO L79 Accepts]: Start accepts. Automaton has 4141 states and 5260 transitions. Word has length 226 [2025-04-30 10:08:38,100 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:38,100 INFO L485 AbstractCegarLoop]: Abstraction has 4141 states and 5260 transitions. [2025-04-30 10:08:38,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:38,100 INFO L278 IsEmpty]: Start isEmpty. Operand 4141 states and 5260 transitions. [2025-04-30 10:08:38,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-04-30 10:08:38,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:38,104 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:38,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:08:38,105 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:38,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2010166851, now seen corresponding path program 1 times [2025-04-30 10:08:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:38,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386222801] [2025-04-30 10:08:38,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:38,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:38,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-04-30 10:08:38,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-04-30 10:08:38,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:38,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-04-30 10:08:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:38,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386222801] [2025-04-30 10:08:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386222801] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557898624] [2025-04-30 10:08:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:38,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:38,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:38,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:38,244 INFO L87 Difference]: Start difference. First operand 4141 states and 5260 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:38,325 INFO L93 Difference]: Finished difference Result 4351 states and 5546 transitions. [2025-04-30 10:08:38,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:38,325 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-04-30 10:08:38,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:38,331 INFO L225 Difference]: With dead ends: 4351 [2025-04-30 10:08:38,331 INFO L226 Difference]: Without dead ends: 4137 [2025-04-30 10:08:38,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:38,333 INFO L437 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:38,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2025-04-30 10:08:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4137. [2025-04-30 10:08:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4136 states have (on average 1.269825918762089) internal successors, (5252), 4136 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5252 transitions. [2025-04-30 10:08:38,394 INFO L79 Accepts]: Start accepts. Automaton has 4137 states and 5252 transitions. Word has length 226 [2025-04-30 10:08:38,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:38,394 INFO L485 AbstractCegarLoop]: Abstraction has 4137 states and 5252 transitions. [2025-04-30 10:08:38,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:38,394 INFO L278 IsEmpty]: Start isEmpty. Operand 4137 states and 5252 transitions. [2025-04-30 10:08:38,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-04-30 10:08:38,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:38,398 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:38,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:08:38,398 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:38,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:38,399 INFO L85 PathProgramCache]: Analyzing trace with hash 765174827, now seen corresponding path program 2 times [2025-04-30 10:08:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:38,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515218573] [2025-04-30 10:08:38,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:38,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:38,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 226 statements into 2 equivalence classes. [2025-04-30 10:08:38,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 226 of 226 statements. [2025-04-30 10:08:38,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2025-04-30 10:08:38,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:38,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515218573] [2025-04-30 10:08:38,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515218573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:38,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:38,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223520769] [2025-04-30 10:08:38,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:38,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:38,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:38,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:38,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:38,617 INFO L87 Difference]: Start difference. First operand 4137 states and 5252 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:42,650 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-30 10:08:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:42,739 INFO L93 Difference]: Finished difference Result 4424 states and 5653 transitions. [2025-04-30 10:08:42,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:42,739 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-04-30 10:08:42,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:42,745 INFO L225 Difference]: With dead ends: 4424 [2025-04-30 10:08:42,745 INFO L226 Difference]: Without dead ends: 4146 [2025-04-30 10:08:42,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:42,746 INFO L437 NwaCegarLoop]: 152 mSDtfsCounter, 16 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:42,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 394 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-04-30 10:08:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2025-04-30 10:08:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4143. [2025-04-30 10:08:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.2689521970062771) internal successors, (5256), 4142 states have internal predecessors, (5256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5256 transitions. [2025-04-30 10:08:42,822 INFO L79 Accepts]: Start accepts. Automaton has 4143 states and 5256 transitions. Word has length 226 [2025-04-30 10:08:42,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:42,822 INFO L485 AbstractCegarLoop]: Abstraction has 4143 states and 5256 transitions. [2025-04-30 10:08:42,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:42,822 INFO L278 IsEmpty]: Start isEmpty. Operand 4143 states and 5256 transitions. [2025-04-30 10:08:42,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-04-30 10:08:42,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:42,826 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:42,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-30 10:08:42,827 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:42,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:42,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1819856939, now seen corresponding path program 1 times [2025-04-30 10:08:42,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:42,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595889539] [2025-04-30 10:08:42,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:42,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:08:42,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:08:42,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:42,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-04-30 10:08:43,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:43,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595889539] [2025-04-30 10:08:43,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595889539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:43,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:43,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:08:43,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962205618] [2025-04-30 10:08:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:43,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:43,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:43,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:43,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:43,137 INFO L87 Difference]: Start difference. First operand 4143 states and 5256 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:43,601 INFO L93 Difference]: Finished difference Result 4413 states and 5630 transitions. [2025-04-30 10:08:43,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:08:43,601 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2025-04-30 10:08:43,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:43,607 INFO L225 Difference]: With dead ends: 4413 [2025-04-30 10:08:43,607 INFO L226 Difference]: Without dead ends: 4155 [2025-04-30 10:08:43,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:08:43,608 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:43,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:08:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2025-04-30 10:08:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 4155. [2025-04-30 10:08:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 4154 states have (on average 1.268175252768416) internal successors, (5268), 4154 states have internal predecessors, (5268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5268 transitions. [2025-04-30 10:08:43,652 INFO L79 Accepts]: Start accepts. Automaton has 4155 states and 5268 transitions. Word has length 227 [2025-04-30 10:08:43,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:43,652 INFO L485 AbstractCegarLoop]: Abstraction has 4155 states and 5268 transitions. [2025-04-30 10:08:43,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:43,652 INFO L278 IsEmpty]: Start isEmpty. Operand 4155 states and 5268 transitions. [2025-04-30 10:08:43,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-04-30 10:08:43,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:43,656 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:43,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-30 10:08:43,657 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:43,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:43,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1341013276, now seen corresponding path program 1 times [2025-04-30 10:08:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:43,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073198159] [2025-04-30 10:08:43,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:43,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:08:43,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:08:43,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:43,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2025-04-30 10:08:43,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:43,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073198159] [2025-04-30 10:08:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073198159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613742154] [2025-04-30 10:08:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:43,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:43,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:43,789 INFO L87 Difference]: Start difference. First operand 4155 states and 5268 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:43,924 INFO L93 Difference]: Finished difference Result 4199 states and 5316 transitions. [2025-04-30 10:08:43,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:43,924 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2025-04-30 10:08:43,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:43,928 INFO L225 Difference]: With dead ends: 4199 [2025-04-30 10:08:43,929 INFO L226 Difference]: Without dead ends: 4159 [2025-04-30 10:08:43,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:43,930 INFO L437 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:43,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 328 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:43,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2025-04-30 10:08:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 4158. [2025-04-30 10:08:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 4157 states have (on average 1.2679817175847967) internal successors, (5271), 4157 states have internal predecessors, (5271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 5271 transitions. [2025-04-30 10:08:43,979 INFO L79 Accepts]: Start accepts. Automaton has 4158 states and 5271 transitions. Word has length 227 [2025-04-30 10:08:43,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:43,979 INFO L485 AbstractCegarLoop]: Abstraction has 4158 states and 5271 transitions. [2025-04-30 10:08:43,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:43,979 INFO L278 IsEmpty]: Start isEmpty. Operand 4158 states and 5271 transitions. [2025-04-30 10:08:43,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-04-30 10:08:43,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:43,983 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:43,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-30 10:08:43,984 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:43,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1526827139, now seen corresponding path program 1 times [2025-04-30 10:08:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:43,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650544140] [2025-04-30 10:08:43,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:43,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-04-30 10:08:44,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-30 10:08:44,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:44,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-04-30 10:08:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:44,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650544140] [2025-04-30 10:08:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650544140] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:44,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88065100] [2025-04-30 10:08:44,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:44,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:44,245 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:44,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-30 10:08:44,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-04-30 10:08:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-30 10:08:44,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:44,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:44,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:08:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-04-30 10:08:44,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-04-30 10:08:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88065100] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 9] total 11 [2025-04-30 10:08:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764649387] [2025-04-30 10:08:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:44,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:08:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:44,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:08:44,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:44,718 INFO L87 Difference]: Start difference. First operand 4158 states and 5271 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:44,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:44,772 INFO L93 Difference]: Finished difference Result 4279 states and 5437 transitions. [2025-04-30 10:08:44,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:08:44,772 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-04-30 10:08:44,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:44,777 INFO L225 Difference]: With dead ends: 4279 [2025-04-30 10:08:44,777 INFO L226 Difference]: Without dead ends: 4165 [2025-04-30 10:08:44,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 448 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:08:44,778 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:44,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2025-04-30 10:08:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 4165. [2025-04-30 10:08:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.2675312199807878) internal successors, (5278), 4164 states have internal predecessors, (5278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5278 transitions. [2025-04-30 10:08:44,847 INFO L79 Accepts]: Start accepts. Automaton has 4165 states and 5278 transitions. Word has length 228 [2025-04-30 10:08:44,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:44,848 INFO L485 AbstractCegarLoop]: Abstraction has 4165 states and 5278 transitions. [2025-04-30 10:08:44,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:44,848 INFO L278 IsEmpty]: Start isEmpty. Operand 4165 states and 5278 transitions. [2025-04-30 10:08:44,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-04-30 10:08:44,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:44,852 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:44,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:45,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-30 10:08:45,053 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:45,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1926874443, now seen corresponding path program 1 times [2025-04-30 10:08:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:45,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363696001] [2025-04-30 10:08:45,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:45,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-04-30 10:08:45,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-30 10:08:45,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:45,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2025-04-30 10:08:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:45,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363696001] [2025-04-30 10:08:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363696001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:45,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336229760] [2025-04-30 10:08:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:45,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:45,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:45,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:45,335 INFO L87 Difference]: Start difference. First operand 4165 states and 5278 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:45,441 INFO L93 Difference]: Finished difference Result 4279 states and 5433 transitions. [2025-04-30 10:08:45,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:45,441 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-04-30 10:08:45,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:45,446 INFO L225 Difference]: With dead ends: 4279 [2025-04-30 10:08:45,446 INFO L226 Difference]: Without dead ends: 4181 [2025-04-30 10:08:45,446 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:45,447 INFO L437 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:45,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 363 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2025-04-30 10:08:45,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4177. [2025-04-30 10:08:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 4176 states have (on average 1.2667624521072798) internal successors, (5290), 4176 states have internal predecessors, (5290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 5290 transitions. [2025-04-30 10:08:45,503 INFO L79 Accepts]: Start accepts. Automaton has 4177 states and 5290 transitions. Word has length 228 [2025-04-30 10:08:45,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:45,503 INFO L485 AbstractCegarLoop]: Abstraction has 4177 states and 5290 transitions. [2025-04-30 10:08:45,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:45,504 INFO L278 IsEmpty]: Start isEmpty. Operand 4177 states and 5290 transitions. [2025-04-30 10:08:45,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-04-30 10:08:45,508 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:45,508 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:45,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-30 10:08:45,508 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:45,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2066192856, now seen corresponding path program 1 times [2025-04-30 10:08:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:45,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837004052] [2025-04-30 10:08:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:45,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-04-30 10:08:45,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-04-30 10:08:45,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:45,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-04-30 10:08:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:45,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837004052] [2025-04-30 10:08:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837004052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:08:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679660009] [2025-04-30 10:08:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:45,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:08:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:45,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:08:45,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:45,671 INFO L87 Difference]: Start difference. First operand 4177 states and 5290 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:46,083 INFO L93 Difference]: Finished difference Result 4299 states and 5436 transitions. [2025-04-30 10:08:46,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:46,083 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-04-30 10:08:46,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:46,087 INFO L225 Difference]: With dead ends: 4299 [2025-04-30 10:08:46,088 INFO L226 Difference]: Without dead ends: 4178 [2025-04-30 10:08:46,088 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:08:46,089 INFO L437 NwaCegarLoop]: 116 mSDtfsCounter, 5 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:46,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 326 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-30 10:08:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-04-30 10:08:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4178. [2025-04-30 10:08:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.2664591812305483) internal successors, (5290), 4177 states have internal predecessors, (5290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 5290 transitions. [2025-04-30 10:08:46,135 INFO L79 Accepts]: Start accepts. Automaton has 4178 states and 5290 transitions. Word has length 228 [2025-04-30 10:08:46,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:46,136 INFO L485 AbstractCegarLoop]: Abstraction has 4178 states and 5290 transitions. [2025-04-30 10:08:46,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:46,136 INFO L278 IsEmpty]: Start isEmpty. Operand 4178 states and 5290 transitions. [2025-04-30 10:08:46,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-04-30 10:08:46,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:46,140 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:46,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-30 10:08:46,140 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:46,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash 760078875, now seen corresponding path program 1 times [2025-04-30 10:08:46,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:46,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566805235] [2025-04-30 10:08:46,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:46,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:08:46,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:08:46,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:46,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-04-30 10:08:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:46,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566805235] [2025-04-30 10:08:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566805235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:46,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380323644] [2025-04-30 10:08:46,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:46,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:46,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:46,510 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:46,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-30 10:08:46,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:08:46,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:08:46,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:46,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:46,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:08:46,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-04-30 10:08:46,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:46,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380323644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:46,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:08:46,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-04-30 10:08:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445429336] [2025-04-30 10:08:46,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:46,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:08:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:46,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:08:46,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:08:46,645 INFO L87 Difference]: Start difference. First operand 4178 states and 5290 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:46,761 INFO L93 Difference]: Finished difference Result 4255 states and 5394 transitions. [2025-04-30 10:08:46,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:08:46,761 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-04-30 10:08:46,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:46,765 INFO L225 Difference]: With dead ends: 4255 [2025-04-30 10:08:46,765 INFO L226 Difference]: Without dead ends: 4194 [2025-04-30 10:08:46,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:08:46,767 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:46,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 476 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2025-04-30 10:08:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4190. [2025-04-30 10:08:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.2656958701360708) internal successors, (5302), 4189 states have internal predecessors, (5302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 5302 transitions. [2025-04-30 10:08:46,815 INFO L79 Accepts]: Start accepts. Automaton has 4190 states and 5302 transitions. Word has length 229 [2025-04-30 10:08:46,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:46,815 INFO L485 AbstractCegarLoop]: Abstraction has 4190 states and 5302 transitions. [2025-04-30 10:08:46,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:46,815 INFO L278 IsEmpty]: Start isEmpty. Operand 4190 states and 5302 transitions. [2025-04-30 10:08:46,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-04-30 10:08:46,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:46,819 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-30 10:08:46,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:47,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:47,024 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:47,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash 269180402, now seen corresponding path program 1 times [2025-04-30 10:08:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:47,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759864261] [2025-04-30 10:08:47,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:47,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:08:47,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:08:47,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:47,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2025-04-30 10:08:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:08:47,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759864261] [2025-04-30 10:08:47,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759864261] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:08:47,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278675591] [2025-04-30 10:08:47,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:47,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:47,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:47,314 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:47,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-30 10:08:47,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:08:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:08:47,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:47,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:47,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:08:47,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-04-30 10:08:47,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 165 proven. 15 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-04-30 10:08:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278675591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:48,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:08:48,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 15 [2025-04-30 10:08:48,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146166738] [2025-04-30 10:08:48,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:48,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-30 10:08:48,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:08:48,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-30 10:08:48,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:08:48,053 INFO L87 Difference]: Start difference. First operand 4190 states and 5302 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:48,249 INFO L93 Difference]: Finished difference Result 4462 states and 5659 transitions. [2025-04-30 10:08:48,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:08:48,249 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-04-30 10:08:48,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:48,253 INFO L225 Difference]: With dead ends: 4462 [2025-04-30 10:08:48,253 INFO L226 Difference]: Without dead ends: 4187 [2025-04-30 10:08:48,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 445 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-04-30 10:08:48,254 INFO L437 NwaCegarLoop]: 123 mSDtfsCounter, 139 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:48,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 869 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4187 states. [2025-04-30 10:08:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4187 to 4187. [2025-04-30 10:08:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 4186 states have (on average 1.2637362637362637) internal successors, (5290), 4186 states have internal predecessors, (5290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 5290 transitions. [2025-04-30 10:08:48,322 INFO L79 Accepts]: Start accepts. Automaton has 4187 states and 5290 transitions. Word has length 229 [2025-04-30 10:08:48,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:48,322 INFO L485 AbstractCegarLoop]: Abstraction has 4187 states and 5290 transitions. [2025-04-30 10:08:48,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:48,322 INFO L278 IsEmpty]: Start isEmpty. Operand 4187 states and 5290 transitions. [2025-04-30 10:08:48,325 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-04-30 10:08:48,325 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:48,326 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:48,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-30 10:08:48,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:48,527 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:48,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash 379866759, now seen corresponding path program 1 times [2025-04-30 10:08:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:08:48,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068461390] [2025-04-30 10:08:48,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:08:48,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:08:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:08:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:08:48,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:08:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:08:48,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:08:48,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:48,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:08:48,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:08:48,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:08:48,693 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-30 10:08:48,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-30 10:08:48,696 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:08:48,781 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:08:48,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:08:48 BoogieIcfgContainer [2025-04-30 10:08:48,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:08:48,783 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:08:48,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:08:48,784 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:08:48,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:13" (3/4) ... [2025-04-30 10:08:48,786 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-30 10:08:48,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:08:48,787 INFO L158 Benchmark]: Toolchain (without parser) took 37526.19ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 115.2MB in the beginning and 568.8MB in the end (delta: -453.6MB). Peak memory consumption was 359.0MB. Max. memory is 16.1GB. [2025-04-30 10:08:48,787 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:08:48,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.80ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 99.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:08:48,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.60ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:08:48,788 INFO L158 Benchmark]: Boogie Preprocessor took 42.38ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:08:48,788 INFO L158 Benchmark]: RCFGBuilder took 1415.92ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 69.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:08:48,788 INFO L158 Benchmark]: TraceAbstraction took 35763.42ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 68.6MB in the beginning and 568.9MB in the end (delta: -500.3MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB. [2025-04-30 10:08:48,789 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 956.3MB. Free memory was 568.9MB in the beginning and 568.8MB in the end (delta: 156.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:08:48,789 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.21ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.80ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 99.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.60ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 97.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.38ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1415.92ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 69.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35763.42ms. Allocated memory was 142.6MB in the beginning and 956.3MB in the end (delta: 813.7MB). Free memory was 68.6MB in the beginning and 568.9MB in the end (delta: -500.3MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 956.3MB. Free memory was 568.9MB in the beginning and 568.8MB in the end (delta: 156.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 59, overapproximation of bitwiseAnd at line 50. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [i=0, z=0] [L50] EXPR x & (1U << i) VAL [i=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=0, x=0, z=0] [L50] EXPR 1U << i VAL [i=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [i=0, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=0, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=0, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=1, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=1, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=1, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=1, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=1, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=2, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=2, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=2, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=2, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=2, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=3, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=3, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=3, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=3, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=3, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=4, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=4, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=4, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=4, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=4, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=5, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=5, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=5, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=5, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=5, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=6, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=6, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=6, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=6, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=6, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=7, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=7, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=7, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=7, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=7, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=8, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=8, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=8, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=8, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=8, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=9, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=9, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=9, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=9, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=9, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=10, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=10, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=10, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=10, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=10, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=11, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=11, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=11, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=11, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=11, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=12, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=12, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=12, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=12, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=12, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=13, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=13, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=13, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=13, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=13, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=14, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=14, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=14, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=14, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=14, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=2, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=2, z=0] [L50] EXPR x & (1U << i) VAL [i=15, x=0, y=2, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=15, x=0, y=2, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=2, z=0] [L50] EXPR y & (1U << i) VAL [i=15, x=0, y=2, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=15, x=0, y=2, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=15, x=0, y=2, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=2, z=-4294967295] [L49] COND FALSE !(i < sizeof(x) * 8) [L53] xx = x [L54] yy = y VAL [xx=0, yy=2, z=-4294967295] [L55] EXPR xx | (xx << 8u) VAL [yy=2, z=-4294967295] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [yy=2, z=-4294967295] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [yy=2, z=-4294967295] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [yy=2, z=-4294967295] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [yy=2, z=-4294967295] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [yy=2, z=-4294967295] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [yy=2, z=-4294967295] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [yy=2, z=-4294967295] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [xx=0, z=-4294967295] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [xx=0, z=-4294967295] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [xx=0, z=-4294967295] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [xx=0, z=-4294967295] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [xx=0, z=-4294967295] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [xx=0, z=-4294967295] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [xx=0, z=-4294967295] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [xx=0, z=-4294967295] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [z=-4294967295] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 138 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 32, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 6368 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6368 mSDsluCounter, 26139 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21530 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7954 IncrementalHoareTripleChecker+Invalid, 8291 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 4609 mSDtfsCounter, 7954 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5678 GetRequests, 5022 SyntacticMatches, 8 SemanticMatches, 648 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55354 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=30, InterpolantAutomatonStates: 524, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 3072 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 8437 NumberOfCodeBlocks, 8331 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 10341 ConstructedInterpolants, 0 QuantifiedInterpolants, 26727 SizeOfPredicates, 33 NumberOfNonLiveVariables, 7491 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 65 InterpolantComputations, 23 PerfectInterpolantSequences, 37601/46670 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-30 10:08:48,807 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 0 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 ../../../trunk/examples/svcomp/bitvector/interleave_bits.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:08:50,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:08:50,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-04-30 10:08:50,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:08:50,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:08:50,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:08:50,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:08:50,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:08:50,658 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:08:50,658 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:08:50,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:08:50,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:08:50,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:08:50,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:08:50,660 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:50,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:08:50,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:50,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:08:50,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:08:50,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:08:50,662 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-04-30 10:08:50,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:08:50,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:08:50,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:08:50,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:08:50,910 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:08:50,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/interleave_bits.i [2025-04-30 10:08:52,160 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523b14ece/e3002db831074db6a4fc240cbb82de98/FLAGbbe40a3e1 [2025-04-30 10:08:52,325 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:08:52,325 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i [2025-04-30 10:08:52,331 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523b14ece/e3002db831074db6a4fc240cbb82de98/FLAGbbe40a3e1 [2025-04-30 10:08:53,161 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523b14ece/e3002db831074db6a4fc240cbb82de98 [2025-04-30 10:08:53,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:08:53,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:08:53,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:08:53,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:08:53,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:08:53,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b46b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53, skipping insertion in model container [2025-04-30 10:08:53,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:08:53,301 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i[1175,1188] [2025-04-30 10:08:53,320 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:08:53,327 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:08:53,347 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/interleave_bits.i[1175,1188] [2025-04-30 10:08:53,358 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:08:53,370 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:08:53,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53 WrapperNode [2025-04-30 10:08:53,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:08:53,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:08:53,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:08:53,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:08:53,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,398 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-04-30 10:08:53,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:08:53,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:08:53,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:08:53,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:08:53,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,422 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-04-30 10:08:53,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,426 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,426 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:08:53,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:08:53,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:08:53,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:08:53,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (1/1) ... [2025-04-30 10:08:53,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:08:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:53,461 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-04-30 10:08:53,464 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-04-30 10:08:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:08:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-04-30 10:08:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:08:53,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:08:53,533 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:08:53,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:08:53,614 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-04-30 10:08:53,614 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:08:53,619 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:08:53,619 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:08:53,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:53 BoogieIcfgContainer [2025-04-30 10:08:53,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:08:53,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:08:53,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:08:53,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:08:53,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:08:53" (1/3) ... [2025-04-30 10:08:53,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b160169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:08:53, skipping insertion in model container [2025-04-30 10:08:53,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:08:53" (2/3) ... [2025-04-30 10:08:53,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b160169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:08:53, skipping insertion in model container [2025-04-30 10:08:53,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:08:53" (3/3) ... [2025-04-30 10:08:53,628 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-04-30 10:08:53,637 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:08:53,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 10 locations, 11 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-30 10:08:53,674 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:08:53,681 INFO L340 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;@4f5853c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:08:53,681 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:08:53,683 INFO L278 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:53,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:08:53,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:53,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:08:53,686 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:53,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash 28696775, now seen corresponding path program 1 times [2025-04-30 10:08:53,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:08:53,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789336963] [2025-04-30 10:08:53,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:53,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:53,697 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-04-30 10:08:53,698 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-04-30 10:08:53,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:08:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:08:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:53,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-30 10:08:53,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:53,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:08:53,768 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:08:53,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789336963] [2025-04-30 10:08:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789336963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:08:53,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:08:53,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:08:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010109987] [2025-04-30 10:08:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:08:53,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:08:53,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:08:53,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:08:53,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:08:53,784 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:53,808 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-04-30 10:08:53,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:08:53,811 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:08:53,811 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:53,815 INFO L225 Difference]: With dead ends: 18 [2025-04-30 10:08:53,815 INFO L226 Difference]: Without dead ends: 7 [2025-04-30 10:08:53,817 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:08:53,821 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:53,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-04-30 10:08:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-04-30 10:08:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-04-30 10:08:53,843 INFO L79 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-04-30 10:08:53,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:53,843 INFO L485 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-04-30 10:08:53,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:53,843 INFO L278 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-04-30 10:08:53,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:08:53,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:53,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:08:53,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:54,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:54,044 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:54,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash 889537511, now seen corresponding path program 1 times [2025-04-30 10:08:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:08:54,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825335836] [2025-04-30 10:08:54,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:08:54,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:54,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:54,047 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-04-30 10:08:54,048 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-04-30 10:08:54,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:08:54,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:08:54,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:08:54,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:54,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:08:54,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:54,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:54,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:08:54,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825335836] [2025-04-30 10:08:54,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825335836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:54,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:54,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-04-30 10:08:54,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494125402] [2025-04-30 10:08:54,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:54,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:08:54,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:08:54,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:08:54,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:08:54,146 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:54,173 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-04-30 10:08:54,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:08:54,173 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:08:54,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:54,173 INFO L225 Difference]: With dead ends: 13 [2025-04-30 10:08:54,174 INFO L226 Difference]: Without dead ends: 10 [2025-04-30 10:08:54,174 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:08:54,174 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:54,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-04-30 10:08:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-04-30 10:08:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-04-30 10:08:54,177 INFO L79 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2025-04-30 10:08:54,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:54,177 INFO L485 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-04-30 10:08:54,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:54,177 INFO L278 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-04-30 10:08:54,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:08:54,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:54,177 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-30 10:08:54,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:54,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:54,378 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:54,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:54,378 INFO L85 PathProgramCache]: Analyzing trace with hash 201697479, now seen corresponding path program 2 times [2025-04-30 10:08:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:08:54,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694995157] [2025-04-30 10:08:54,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:08:54,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:54,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:54,381 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-04-30 10:08:54,381 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-04-30 10:08:54,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-30 10:08:54,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:08:54,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:08:54,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:54,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-30 10:08:54,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:54,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:54,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:08:54,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694995157] [2025-04-30 10:08:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694995157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:54,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-04-30 10:08:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155668418] [2025-04-30 10:08:54,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:54,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:08:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:08:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:08:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:08:54,589 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:54,698 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-04-30 10:08:54,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:08:54,698 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-04-30 10:08:54,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:54,699 INFO L225 Difference]: With dead ends: 19 [2025-04-30 10:08:54,699 INFO L226 Difference]: Without dead ends: 16 [2025-04-30 10:08:54,699 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:08:54,699 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:54,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:08:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-04-30 10:08:54,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-04-30 10:08:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-04-30 10:08:54,702 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2025-04-30 10:08:54,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:54,703 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-04-30 10:08:54,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:54,703 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-04-30 10:08:54,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:08:54,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:54,703 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-30 10:08:54,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:54,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:54,907 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:54,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:54,907 INFO L85 PathProgramCache]: Analyzing trace with hash -763767609, now seen corresponding path program 3 times [2025-04-30 10:08:54,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:08:54,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1193833490] [2025-04-30 10:08:54,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:08:54,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:54,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:54,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:54,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:08:54,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-04-30 10:08:54,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:08:54,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-30 10:08:54,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:54,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:08:54,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:55,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:08:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:55,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-30 10:08:55,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193833490] [2025-04-30 10:08:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193833490] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:08:55,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-30 10:08:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-04-30 10:08:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443971687] [2025-04-30 10:08:55,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-30 10:08:55,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-30 10:08:55,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-30 10:08:55,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-30 10:08:55,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2025-04-30 10:08:55,368 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:08:55,909 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-04-30 10:08:55,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-30 10:08:55,909 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:08:55,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:08:55,910 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:08:55,910 INFO L226 Difference]: Without dead ends: 28 [2025-04-30 10:08:55,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=771, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:08:55,911 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:08:55,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:08:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-30 10:08:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-04-30 10:08:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-04-30 10:08:55,920 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2025-04-30 10:08:55,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:08:55,920 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-04-30 10:08:55,920 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:08:55,920 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-04-30 10:08:55,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:08:55,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:08:55,920 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2025-04-30 10:08:55,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:08:56,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:56,122 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:08:56,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:08:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2078474041, now seen corresponding path program 4 times [2025-04-30 10:08:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-30 10:08:56,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240910905] [2025-04-30 10:08:56,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:08:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:08:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:08:56,125 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:08:56,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:08:56,148 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:08:56,195 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:08:56,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:08:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:08:56,202 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-30 10:08:56,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:08:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:08:57,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15