./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:43:03,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:43:03,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:43:03,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:43:03,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:43:03,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:43:03,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:43:03,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:43:03,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:43:03,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:43:03,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:43:03,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:43:03,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:43:03,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:43:03,113 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:43:03,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:43:03,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:43:03,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:43:03,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:43:03,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:43:03,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:43:03,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:43:03,115 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa [2025-03-16 22:43:03,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:43:03,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:43:03,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:43:03,335 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:43:03,335 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:43:03,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2025-03-16 22:43:04,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1eece95/e53cc7e7794e46ab967556d917a7aaa5/FLAG26e5cb5f4 [2025-03-16 22:43:04,650 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:43:04,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2025-03-16 22:43:04,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1eece95/e53cc7e7794e46ab967556d917a7aaa5/FLAG26e5cb5f4 [2025-03-16 22:43:05,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1eece95/e53cc7e7794e46ab967556d917a7aaa5 [2025-03-16 22:43:05,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:43:05,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:43:05,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:43:05,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:43:05,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:43:05,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da0e4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05, skipping insertion in model container [2025-03-16 22:43:05,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:43:05,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2025-03-16 22:43:05,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:43:05,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:43:05,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2025-03-16 22:43:05,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:43:05,149 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:43:05,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05 WrapperNode [2025-03-16 22:43:05,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:43:05,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:43:05,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:43:05,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:43:05,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,184 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2025-03-16 22:43:05,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:43:05,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:43:05,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:43:05,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:43:05,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 22:43:05,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:43:05,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:43:05,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:43:05,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:43:05,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (1/1) ... [2025-03-16 22:43:05,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:43:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:05,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 22:43:05,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 22:43:05,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:43:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:43:05,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:43:05,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:43:05,308 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:43:05,309 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:43:05,537 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-16 22:43:05,540 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:43:05,557 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:43:05,557 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:43:05,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:43:05 BoogieIcfgContainer [2025-03-16 22:43:05,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:43:05,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:43:05,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:43:05,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:43:05,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:43:05" (1/3) ... [2025-03-16 22:43:05,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1466dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:43:05, skipping insertion in model container [2025-03-16 22:43:05,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:05" (2/3) ... [2025-03-16 22:43:05,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1466dacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:43:05, skipping insertion in model container [2025-03-16 22:43:05,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:43:05" (3/3) ... [2025-03-16 22:43:05,568 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2025-03-16 22:43:05,578 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:43:05,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.twocount2.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:43:05,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:43:05,630 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44b07bf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:43:05,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:43:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 22:43:05,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:05,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:05,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 511558256, now seen corresponding path program 1 times [2025-03-16 22:43:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503044370] [2025-03-16 22:43:05,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:05,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 22:43:05,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 22:43:05,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:06,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503044370] [2025-03-16 22:43:06,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503044370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:06,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:06,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:43:06,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879560303] [2025-03-16 22:43:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:06,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:43:06,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:06,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:43:06,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:43:06,026 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 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 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:06,070 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2025-03-16 22:43:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:43:06,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-16 22:43:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:06,076 INFO L225 Difference]: With dead ends: 71 [2025-03-16 22:43:06,076 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 22:43:06,078 INFO L434 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-03-16 22:43:06,080 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:06,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:43:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 22:43:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-16 22:43:06,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-16 22:43:06,104 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 14 [2025-03-16 22:43:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:06,104 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-16 22:43:06,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-16 22:43:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 22:43:06,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:06,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:06,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:43:06,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1316884084, now seen corresponding path program 1 times [2025-03-16 22:43:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51434249] [2025-03-16 22:43:06,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:06,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 22:43:06,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 22:43:06,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:06,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51434249] [2025-03-16 22:43:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51434249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:06,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:43:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150013031] [2025-03-16 22:43:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:06,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:43:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:06,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:43:06,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:43:06,230 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03-16 22:43:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:06,264 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2025-03-16 22:43:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:43:06,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 15 [2025-03-16 22:43:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:06,266 INFO L225 Difference]: With dead ends: 73 [2025-03-16 22:43:06,266 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 22:43:06,266 INFO L434 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-03-16 22:43:06,267 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 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.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:06,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:43:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 22:43:06,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-16 22:43:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-16 22:43:06,271 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 15 [2025-03-16 22:43:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:06,273 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-16 22:43:06,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-03-16 22:43:06,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-16 22:43:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 22:43:06,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:06,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:06,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:43:06,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:06,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -237191701, now seen corresponding path program 1 times [2025-03-16 22:43:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245807] [2025-03-16 22:43:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 22:43:06,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 22:43:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:06,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:06,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245807] [2025-03-16 22:43:06,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:06,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:06,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:43:06,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916709047] [2025-03-16 22:43:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:06,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:43:06,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:06,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:43:06,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:06,487 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-03-16 22:43:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:06,603 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2025-03-16 22:43:06,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:43:06,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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) Word has length 16 [2025-03-16 22:43:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:06,606 INFO L225 Difference]: With dead ends: 86 [2025-03-16 22:43:06,606 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 22:43:06,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:43:06,607 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:06,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 217 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 22:43:06,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2025-03-16 22:43:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2025-03-16 22:43:06,614 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 16 [2025-03-16 22:43:06,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:06,614 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2025-03-16 22:43:06,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-03-16 22:43:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2025-03-16 22:43:06,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 22:43:06,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:06,615 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:43:06,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:43:06,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:06,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:06,615 INFO L85 PathProgramCache]: Analyzing trace with hash -524993731, now seen corresponding path program 1 times [2025-03-16 22:43:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730521135] [2025-03-16 22:43:06,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:06,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:06,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 22:43:06,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 22:43:06,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:06,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730521135] [2025-03-16 22:43:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730521135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552807672] [2025-03-16 22:43:06,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:06,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:06,771 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:43:06,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 22:43:06,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 22:43:06,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 22:43:06,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:06,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:06,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-16 22:43:06,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:07,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:07,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552807672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:07,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 20 [2025-03-16 22:43:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609487773] [2025-03-16 22:43:07,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:07,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 22:43:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:07,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 22:43:07,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:43:07,543 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 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-03-16 22:43:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:08,062 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2025-03-16 22:43:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 22:43:08,063 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 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 31 [2025-03-16 22:43:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:08,065 INFO L225 Difference]: With dead ends: 172 [2025-03-16 22:43:08,065 INFO L226 Difference]: Without dead ends: 139 [2025-03-16 22:43:08,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 22:43:08,066 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 265 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:08,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 296 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:43:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-16 22:43:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 83. [2025-03-16 22:43:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2025-03-16 22:43:08,077 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 31 [2025-03-16 22:43:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:08,078 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2025-03-16 22:43:08,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 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-03-16 22:43:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2025-03-16 22:43:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 22:43:08,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:08,078 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:43:08,085 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-03-16 22:43:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:08,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:08,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:08,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1314393001, now seen corresponding path program 1 times [2025-03-16 22:43:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625851692] [2025-03-16 22:43:08,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:08,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:43:08,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:43:08,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:08,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625851692] [2025-03-16 22:43:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625851692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:08,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132823509] [2025-03-16 22:43:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:08,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:08,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:08,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:43:08,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 22:43:08,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:43:08,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:43:08,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:08,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:08,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 22:43:08,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:08,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132823509] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:08,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:08,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 15 [2025-03-16 22:43:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260305552] [2025-03-16 22:43:08,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 22:43:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:08,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 22:43:08,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-16 22:43:08,894 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:09,105 INFO L93 Difference]: Finished difference Result 207 states and 275 transitions. [2025-03-16 22:43:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:43:09,105 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 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 33 [2025-03-16 22:43:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:09,106 INFO L225 Difference]: With dead ends: 207 [2025-03-16 22:43:09,106 INFO L226 Difference]: Without dead ends: 133 [2025-03-16 22:43:09,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:43:09,107 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:09,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 81 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:43:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-16 22:43:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 83. [2025-03-16 22:43:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2025-03-16 22:43:09,111 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 33 [2025-03-16 22:43:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2025-03-16 22:43:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2025-03-16 22:43:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 22:43:09,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:09,112 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:43:09,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 22:43:09,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:09,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:09,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:09,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1787849697, now seen corresponding path program 1 times [2025-03-16 22:43:09,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510185215] [2025-03-16 22:43:09,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:09,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:43:09,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:43:09,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:09,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:09,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510185215] [2025-03-16 22:43:09,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510185215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:09,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:09,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:43:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337509145] [2025-03-16 22:43:09,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:09,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:43:09,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:09,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:43:09,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:09,459 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:09,527 INFO L93 Difference]: Finished difference Result 187 states and 251 transitions. [2025-03-16 22:43:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:43:09,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2025-03-16 22:43:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:09,528 INFO L225 Difference]: With dead ends: 187 [2025-03-16 22:43:09,528 INFO L226 Difference]: Without dead ends: 113 [2025-03-16 22:43:09,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:09,528 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 61 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:09,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-16 22:43:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2025-03-16 22:43:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2025-03-16 22:43:09,535 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 34 [2025-03-16 22:43:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:09,535 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2025-03-16 22:43:09,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2025-03-16 22:43:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 22:43:09,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:09,536 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:43:09,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:43:09,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:09,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1560750807, now seen corresponding path program 1 times [2025-03-16 22:43:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134854203] [2025-03-16 22:43:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:09,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 22:43:09,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 22:43:09,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:09,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:09,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134854203] [2025-03-16 22:43:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134854203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:43:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181557122] [2025-03-16 22:43:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:09,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:43:09,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:09,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:43:09,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:09,834 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:09,930 INFO L93 Difference]: Finished difference Result 203 states and 271 transitions. [2025-03-16 22:43:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:43:09,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2025-03-16 22:43:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:09,933 INFO L225 Difference]: With dead ends: 203 [2025-03-16 22:43:09,933 INFO L226 Difference]: Without dead ends: 129 [2025-03-16 22:43:09,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:09,933 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:09,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 118 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-16 22:43:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-16 22:43:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 126 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2025-03-16 22:43:09,944 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 35 [2025-03-16 22:43:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:09,944 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2025-03-16 22:43:09,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2025-03-16 22:43:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 22:43:09,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:09,945 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:43:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:43:09,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1972495844, now seen corresponding path program 1 times [2025-03-16 22:43:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145095310] [2025-03-16 22:43:09,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:09,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:43:09,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:43:09,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:09,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145095310] [2025-03-16 22:43:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145095310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332335040] [2025-03-16 22:43:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:10,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:10,470 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:43:10,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 22:43:10,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:43:10,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:43:10,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:10,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:10,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-16 22:43:10,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:10,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:43:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332335040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:10,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:43:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-03-16 22:43:10,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974341707] [2025-03-16 22:43:10,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:10,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:43:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:10,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:43:10,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-16 22:43:10,731 INFO L87 Difference]: Start difference. First operand 127 states and 168 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:10,837 INFO L93 Difference]: Finished difference Result 211 states and 280 transitions. [2025-03-16 22:43:10,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:43:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2025-03-16 22:43:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:10,838 INFO L225 Difference]: With dead ends: 211 [2025-03-16 22:43:10,838 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 22:43:10,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:43:10,838 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:10,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 22:43:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-16 22:43:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.3174603174603174) internal successors, (166), 126 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 166 transitions. [2025-03-16 22:43:10,844 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 166 transitions. Word has length 36 [2025-03-16 22:43:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:10,844 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 166 transitions. [2025-03-16 22:43:10,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 166 transitions. [2025-03-16 22:43:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 22:43:10,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:10,847 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 22:43:10,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:43:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:11,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1489794346, now seen corresponding path program 1 times [2025-03-16 22:43:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899309763] [2025-03-16 22:43:11,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:11,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:43:11,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:43:11,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:11,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899309763] [2025-03-16 22:43:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899309763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:11,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069186051] [2025-03-16 22:43:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:11,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:11,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:43:11,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 22:43:11,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:43:11,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:43:11,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:11,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:11,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-03-16 22:43:11,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:12,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:14,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069186051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:14,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 38 [2025-03-16 22:43:14,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241543761] [2025-03-16 22:43:14,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:14,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 22:43:14,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:14,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 22:43:14,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 22:43:14,705 INFO L87 Difference]: Start difference. First operand 127 states and 166 transitions. Second operand has 39 states, 39 states have (on average 2.6153846153846154) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:15,699 INFO L93 Difference]: Finished difference Result 253 states and 331 transitions. [2025-03-16 22:43:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 22:43:15,699 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6153846153846154) internal successors, (102), 38 states have internal predecessors, (102), 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 37 [2025-03-16 22:43:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:15,700 INFO L225 Difference]: With dead ends: 253 [2025-03-16 22:43:15,700 INFO L226 Difference]: Without dead ends: 179 [2025-03-16 22:43:15,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=2379, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 22:43:15,702 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 136 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:15,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 228 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:43:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-16 22:43:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 117. [2025-03-16 22:43:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2025-03-16 22:43:15,710 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 37 [2025-03-16 22:43:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:15,710 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2025-03-16 22:43:15,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6153846153846154) internal successors, (102), 38 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2025-03-16 22:43:15,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 22:43:15,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:15,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:15,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 22:43:15,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:15,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2030760711, now seen corresponding path program 1 times [2025-03-16 22:43:15,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:15,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747062980] [2025-03-16 22:43:15,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:15,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:15,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 22:43:15,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 22:43:15,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:15,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:16,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:16,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747062980] [2025-03-16 22:43:16,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747062980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:16,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225414372] [2025-03-16 22:43:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:16,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:16,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:16,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:43:16,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 22:43:16,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 22:43:16,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 22:43:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:16,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:16,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-16 22:43:16,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:16,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225414372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:17,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 15] total 31 [2025-03-16 22:43:17,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78991203] [2025-03-16 22:43:17,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:17,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 22:43:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:17,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 22:43:17,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2025-03-16 22:43:17,323 INFO L87 Difference]: Start difference. First operand 117 states and 153 transitions. Second operand has 32 states, 32 states have (on average 4.3125) internal successors, (138), 31 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-03-16 22:43:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:18,288 INFO L93 Difference]: Finished difference Result 431 states and 555 transitions. [2025-03-16 22:43:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-16 22:43:18,288 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.3125) internal successors, (138), 31 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) Word has length 52 [2025-03-16 22:43:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:18,289 INFO L225 Difference]: With dead ends: 431 [2025-03-16 22:43:18,289 INFO L226 Difference]: Without dead ends: 357 [2025-03-16 22:43:18,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=731, Invalid=3691, Unknown=0, NotChecked=0, Total=4422 [2025-03-16 22:43:18,291 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 512 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:18,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 487 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:43:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-16 22:43:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 247. [2025-03-16 22:43:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3048780487804879) internal successors, (321), 246 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 321 transitions. [2025-03-16 22:43:18,297 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 321 transitions. Word has length 52 [2025-03-16 22:43:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:18,298 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 321 transitions. [2025-03-16 22:43:18,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.3125) internal successors, (138), 31 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-03-16 22:43:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 321 transitions. [2025-03-16 22:43:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:43:18,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:18,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:18,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 22:43:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 22:43:18,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:18,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1694749519, now seen corresponding path program 1 times [2025-03-16 22:43:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563515990] [2025-03-16 22:43:18,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:18,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:43:18,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:43:18,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:18,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563515990] [2025-03-16 22:43:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563515990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573843517] [2025-03-16 22:43:18,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:18,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:18,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:18,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 22:43:18,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 22:43:18,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:43:18,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:43:18,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:18,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:18,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 22:43:18,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 22:43:18,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 22:43:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573843517] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:18,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 22:43:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 12 [2025-03-16 22:43:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868267212] [2025-03-16 22:43:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:18,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:43:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:18,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:43:18,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:43:18,967 INFO L87 Difference]: Start difference. First operand 247 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:19,003 INFO L93 Difference]: Finished difference Result 415 states and 541 transitions. [2025-03-16 22:43:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:43:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 54 [2025-03-16 22:43:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:19,006 INFO L225 Difference]: With dead ends: 415 [2025-03-16 22:43:19,006 INFO L226 Difference]: Without dead ends: 227 [2025-03-16 22:43:19,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:43:19,007 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:19,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:43:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-16 22:43:19,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2025-03-16 22:43:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.2811059907834101) internal successors, (278), 217 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2025-03-16 22:43:19,016 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 54 [2025-03-16 22:43:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:19,016 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2025-03-16 22:43:19,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2025-03-16 22:43:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:43:19,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:19,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:19,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 22:43:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:19,218 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2097221286, now seen corresponding path program 1 times [2025-03-16 22:43:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938788875] [2025-03-16 22:43:19,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:19,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:43:19,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:43:19,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:19,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:19,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938788875] [2025-03-16 22:43:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938788875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843602390] [2025-03-16 22:43:19,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:19,478 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-03-16 22:43:19,480 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-03-16 22:43:19,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:43:19,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:43:19,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:19,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:19,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 22:43:19,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:19,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:19,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843602390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:19,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:19,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 21 [2025-03-16 22:43:19,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894923435] [2025-03-16 22:43:19,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:19,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 22:43:19,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:19,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 22:43:19,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:43:19,991 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:20,156 INFO L93 Difference]: Finished difference Result 429 states and 544 transitions. [2025-03-16 22:43:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:43:20,156 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 21 states have internal predecessors, (137), 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 54 [2025-03-16 22:43:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:20,157 INFO L225 Difference]: With dead ends: 429 [2025-03-16 22:43:20,157 INFO L226 Difference]: Without dead ends: 228 [2025-03-16 22:43:20,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-03-16 22:43:20,158 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:20,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 241 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:43:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-16 22:43:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-03-16 22:43:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.271111111111111) internal successors, (286), 225 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 286 transitions. [2025-03-16 22:43:20,162 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 286 transitions. Word has length 54 [2025-03-16 22:43:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:20,162 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 286 transitions. [2025-03-16 22:43:20,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2025-03-16 22:43:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 22:43:20,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:20,163 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:20,169 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-03-16 22:43:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:20,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:20,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1239539496, now seen corresponding path program 1 times [2025-03-16 22:43:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390299952] [2025-03-16 22:43:20,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:20,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 22:43:20,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 22:43:20,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:20,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 22:43:20,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:20,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390299952] [2025-03-16 22:43:20,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390299952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:20,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:20,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:43:20,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898990343] [2025-03-16 22:43:20,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:20,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:43:20,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:20,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:43:20,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:20,503 INFO L87 Difference]: Start difference. First operand 226 states and 286 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:20,551 INFO L93 Difference]: Finished difference Result 397 states and 505 transitions. [2025-03-16 22:43:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:43:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) 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 54 [2025-03-16 22:43:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:20,552 INFO L225 Difference]: With dead ends: 397 [2025-03-16 22:43:20,552 INFO L226 Difference]: Without dead ends: 226 [2025-03-16 22:43:20,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:20,553 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:20,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:43:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-16 22:43:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 151. [2025-03-16 22:43:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 150 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 187 transitions. [2025-03-16 22:43:20,558 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 187 transitions. Word has length 54 [2025-03-16 22:43:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:20,559 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 187 transitions. [2025-03-16 22:43:20,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions. [2025-03-16 22:43:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:43:20,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:20,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:20,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:43:20,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:20,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1220346828, now seen corresponding path program 1 times [2025-03-16 22:43:20,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:20,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675666231] [2025-03-16 22:43:20,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:20,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:20,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:43:20,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:43:20,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:20,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675666231] [2025-03-16 22:43:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675666231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058080940] [2025-03-16 22:43:20,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:20,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:20,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:20,987 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-03-16 22:43:20,989 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-03-16 22:43:21,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:43:21,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:43:21,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:21,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-16 22:43:21,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:21,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058080940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:23,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 19] total 45 [2025-03-16 22:43:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733605965] [2025-03-16 22:43:23,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:23,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-16 22:43:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:23,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-16 22:43:23,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1875, Unknown=0, NotChecked=0, Total=2070 [2025-03-16 22:43:23,922 INFO L87 Difference]: Start difference. First operand 151 states and 187 transitions. Second operand has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:28,414 INFO L93 Difference]: Finished difference Result 538 states and 658 transitions. [2025-03-16 22:43:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-03-16 22:43:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 45 states have internal predecessors, (156), 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 55 [2025-03-16 22:43:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:28,416 INFO L225 Difference]: With dead ends: 538 [2025-03-16 22:43:28,416 INFO L226 Difference]: Without dead ends: 433 [2025-03-16 22:43:28,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6594 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2066, Invalid=19690, Unknown=0, NotChecked=0, Total=21756 [2025-03-16 22:43:28,420 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 743 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:28,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 207 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 22:43:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-16 22:43:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 204. [2025-03-16 22:43:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 203 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2025-03-16 22:43:28,428 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 55 [2025-03-16 22:43:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:28,428 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2025-03-16 22:43:28,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2025-03-16 22:43:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 22:43:28,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:28,429 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:28,436 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-03-16 22:43:28,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 22:43:28,631 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:28,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 920229380, now seen corresponding path program 1 times [2025-03-16 22:43:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:28,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93349541] [2025-03-16 22:43:28,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:28,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 22:43:28,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 22:43:28,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:28,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-16 22:43:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93349541] [2025-03-16 22:43:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93349541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:43:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456286027] [2025-03-16 22:43:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:28,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:43:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:28,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:43:28,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:28,853 INFO L87 Difference]: Start difference. First operand 204 states and 251 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:28,912 INFO L93 Difference]: Finished difference Result 425 states and 518 transitions. [2025-03-16 22:43:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:43:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 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 57 [2025-03-16 22:43:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:28,913 INFO L225 Difference]: With dead ends: 425 [2025-03-16 22:43:28,913 INFO L226 Difference]: Without dead ends: 230 [2025-03-16 22:43:28,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:28,915 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:28,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 188 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-16 22:43:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 215. [2025-03-16 22:43:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.233644859813084) internal successors, (264), 214 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 264 transitions. [2025-03-16 22:43:28,920 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 264 transitions. Word has length 57 [2025-03-16 22:43:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 264 transitions. [2025-03-16 22:43:28,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 264 transitions. [2025-03-16 22:43:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 22:43:28,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:28,921 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:28,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 22:43:28,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash 13855426, now seen corresponding path program 1 times [2025-03-16 22:43:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215969319] [2025-03-16 22:43:28,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:28,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 22:43:28,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 22:43:28,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:28,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215969319] [2025-03-16 22:43:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215969319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995350307] [2025-03-16 22:43:29,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:29,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:29,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:29,404 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-03-16 22:43:29,406 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-03-16 22:43:29,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 22:43:29,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 22:43:29,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:29,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:29,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-16 22:43:29,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:29,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995350307] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:31,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2025-03-16 22:43:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684197777] [2025-03-16 22:43:31,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 22:43:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:31,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 22:43:31,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 22:43:31,074 INFO L87 Difference]: Start difference. First operand 215 states and 264 transitions. Second operand has 36 states, 36 states have (on average 4.166666666666667) internal successors, (150), 35 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:31,802 INFO L93 Difference]: Finished difference Result 634 states and 762 transitions. [2025-03-16 22:43:31,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 22:43:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.166666666666667) internal successors, (150), 35 states have internal predecessors, (150), 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 58 [2025-03-16 22:43:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:31,804 INFO L225 Difference]: With dead ends: 634 [2025-03-16 22:43:31,804 INFO L226 Difference]: Without dead ends: 439 [2025-03-16 22:43:31,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=2541, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 22:43:31,806 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:31,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 353 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 22:43:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-16 22:43:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294. [2025-03-16 22:43:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 354 transitions. [2025-03-16 22:43:31,814 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 354 transitions. Word has length 58 [2025-03-16 22:43:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 354 transitions. [2025-03-16 22:43:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.166666666666667) internal successors, (150), 35 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 354 transitions. [2025-03-16 22:43:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 22:43:31,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:31,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:31,822 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-03-16 22:43:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 22:43:32,020 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:32,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1620812983, now seen corresponding path program 1 times [2025-03-16 22:43:32,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848914143] [2025-03-16 22:43:32,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:32,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 22:43:32,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 22:43:32,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848914143] [2025-03-16 22:43:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848914143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484575649] [2025-03-16 22:43:32,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:32,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:32,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:32,866 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-03-16 22:43:32,867 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-03-16 22:43:32,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 22:43:32,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 22:43:32,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:32,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:32,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-16 22:43:32,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 22:43:33,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 22:43:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484575649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:35,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 51 [2025-03-16 22:43:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444186160] [2025-03-16 22:43:35,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:35,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-16 22:43:35,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:35,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-16 22:43:35,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2425, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 22:43:35,481 INFO L87 Difference]: Start difference. First operand 294 states and 354 transitions. Second operand has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 51 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:37,384 INFO L93 Difference]: Finished difference Result 968 states and 1156 transitions. [2025-03-16 22:43:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-16 22:43:37,384 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 51 states have internal predecessors, (176), 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 61 [2025-03-16 22:43:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:37,386 INFO L225 Difference]: With dead ends: 968 [2025-03-16 22:43:37,386 INFO L226 Difference]: Without dead ends: 760 [2025-03-16 22:43:37,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1866 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=709, Invalid=6431, Unknown=0, NotChecked=0, Total=7140 [2025-03-16 22:43:37,388 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 189 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:37,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 660 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 22:43:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-16 22:43:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 548. [2025-03-16 22:43:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.223034734917733) internal successors, (669), 547 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 669 transitions. [2025-03-16 22:43:37,402 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 669 transitions. Word has length 61 [2025-03-16 22:43:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:37,402 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 669 transitions. [2025-03-16 22:43:37,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 51 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:37,402 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 669 transitions. [2025-03-16 22:43:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 22:43:37,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:37,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:37,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 22:43:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 22:43:37,607 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:37,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 60016139, now seen corresponding path program 1 times [2025-03-16 22:43:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:37,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398803400] [2025-03-16 22:43:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:37,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:37,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 22:43:37,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 22:43:37,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:37,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398803400] [2025-03-16 22:43:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398803400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:38,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980990521] [2025-03-16 22:43:38,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:38,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:38,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:38,421 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-03-16 22:43:38,421 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-03-16 22:43:38,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 22:43:38,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 22:43:38,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:38,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:38,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-16 22:43:38,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:39,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:57,603 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 107 DAG size of output: 103 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)