./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53755642d89d6037be376831b03479fef7eeb8c5758e8107a832bfc0071676df --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:03:58,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:03:58,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:03:58,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:03:58,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:03:58,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:03:58,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:03:58,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:03:58,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:03:58,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:03:58,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:03:58,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:03:58,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:03:58,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:03:58,571 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:03:58,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:03:58,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:03:58,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:03:58,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:03:58,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:03:58,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:03:58,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:03:58,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:03:58,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:03:58,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:03:58,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:03:58,574 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53755642d89d6037be376831b03479fef7eeb8c5758e8107a832bfc0071676df [2025-03-08 14:03:58,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:03:58,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:03:58,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:03:58,832 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:03:58,833 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:03:58,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-03-08 14:04:00,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/435a4a344/cab49f25690d457d82d7fd76628a974a/FLAG2dae1966f [2025-03-08 14:04:00,279 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:04:00,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-03-08 14:04:00,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/435a4a344/cab49f25690d457d82d7fd76628a974a/FLAG2dae1966f [2025-03-08 14:04:00,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/435a4a344/cab49f25690d457d82d7fd76628a974a [2025-03-08 14:04:00,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:04:00,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:04:00,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:04:00,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:04:00,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:04:00,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00, skipping insertion in model container [2025-03-08 14:04:00,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:04:00,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i[916,929] [2025-03-08 14:04:00,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:04:00,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:04:00,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-88.i[916,929] [2025-03-08 14:04:00,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:04:00,895 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:04:00,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00 WrapperNode [2025-03-08 14:04:00,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:04:00,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:04:00,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:04:00,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:04:00,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,940 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 283 [2025-03-08 14:04:00,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:04:00,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:04:00,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:04:00,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:04:00,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,975 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-08 14:04:00,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,988 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:00,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:01,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:04:01,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:04:01,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:04:01,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:04:01,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (1/1) ... [2025-03-08 14:04:01,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:04:01,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:04:01,034 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-08 14:04:01,037 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-08 14:04:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:04:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:04:01,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:04:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:04:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:04:01,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:04:01,130 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:04:01,131 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:04:01,484 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-08 14:04:01,525 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-08 14:04:01,525 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:04:01,545 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:04:01,546 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:04:01,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:01 BoogieIcfgContainer [2025-03-08 14:04:01,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:04:01,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:04:01,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:04:01,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:04:01,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:04:00" (1/3) ... [2025-03-08 14:04:01,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a804d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:01, skipping insertion in model container [2025-03-08 14:04:01,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:04:00" (2/3) ... [2025-03-08 14:04:01,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a804d47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:04:01, skipping insertion in model container [2025-03-08 14:04:01,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:04:01" (3/3) ... [2025-03-08 14:04:01,555 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-88.i [2025-03-08 14:04:01,566 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:04:01,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-88.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:04:01,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:04:01,629 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;@7254865e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:04:01,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:04:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:04:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:04:01,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:01,645 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:01,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:01,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -310363031, now seen corresponding path program 1 times [2025-03-08 14:04:01,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:01,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505960983] [2025-03-08 14:04:01,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:01,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:04:01,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:04:01,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:01,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 14:04:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:01,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505960983] [2025-03-08 14:04:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505960983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:04:01,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282018297] [2025-03-08 14:04:01,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:01,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:04:01,974 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-08 14:04:01,975 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-08 14:04:02,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:04:02,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:04:02,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:02,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:02,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:04:02,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:04:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 14:04:02,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:04:02,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282018297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:02,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:04:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:04:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095067878] [2025-03-08 14:04:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:02,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:04:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:02,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:04:02,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:04:02,187 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 14:04:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:02,225 INFO L93 Difference]: Finished difference Result 229 states and 379 transitions. [2025-03-08 14:04:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:04:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2025-03-08 14:04:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:02,232 INFO L225 Difference]: With dead ends: 229 [2025-03-08 14:04:02,233 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 14:04:02,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:04:02,240 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:02,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:04:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 14:04:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-08 14:04:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 14:04:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2025-03-08 14:04:02,273 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 191 [2025-03-08 14:04:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:02,273 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2025-03-08 14:04:02,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 14:04:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2025-03-08 14:04:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:04:02,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:02,276 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:02,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:04:02,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:04:02,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:02,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1606865627, now seen corresponding path program 1 times [2025-03-08 14:04:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:02,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614735626] [2025-03-08 14:04:02,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:02,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:02,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:04:02,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:04:02,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:02,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:03,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614735626] [2025-03-08 14:04:03,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614735626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:03,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:03,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:04:03,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293916224] [2025-03-08 14:04:03,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:03,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:04:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:03,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:04:03,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:04:03,046 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:03,265 INFO L93 Difference]: Finished difference Result 373 states and 567 transitions. [2025-03-08 14:04:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 14:04:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2025-03-08 14:04:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:03,271 INFO L225 Difference]: With dead ends: 373 [2025-03-08 14:04:03,271 INFO L226 Difference]: Without dead ends: 263 [2025-03-08 14:04:03,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:04:03,273 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 250 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:03,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 466 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:04:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-08 14:04:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 217. [2025-03-08 14:04:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 14:04:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2025-03-08 14:04:03,311 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 191 [2025-03-08 14:04:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:03,313 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2025-03-08 14:04:03,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2025-03-08 14:04:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:04:03,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:03,318 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:03,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:04:03,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:03,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -316429924, now seen corresponding path program 1 times [2025-03-08 14:04:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101330930] [2025-03-08 14:04:03,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:03,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:04:03,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:04:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:04,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101330930] [2025-03-08 14:04:04,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101330930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:04,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:04,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:04:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312759940] [2025-03-08 14:04:04,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:04,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:04:04,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:04,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:04:04,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:04:04,191 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:05,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:05,117 INFO L93 Difference]: Finished difference Result 888 states and 1348 transitions. [2025-03-08 14:04:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:04:05,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-08 14:04:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:05,125 INFO L225 Difference]: With dead ends: 888 [2025-03-08 14:04:05,126 INFO L226 Difference]: Without dead ends: 674 [2025-03-08 14:04:05,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:04:05,129 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 483 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:05,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 733 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:04:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-08 14:04:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 341. [2025-03-08 14:04:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 253 states have (on average 1.391304347826087) internal successors, (352), 253 states have internal predecessors, (352), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 14:04:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 520 transitions. [2025-03-08 14:04:05,215 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 520 transitions. Word has length 192 [2025-03-08 14:04:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:05,216 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 520 transitions. [2025-03-08 14:04:05,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 520 transitions. [2025-03-08 14:04:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:04:05,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:05,220 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:05,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:04:05,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:05,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1191121885, now seen corresponding path program 1 times [2025-03-08 14:04:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956516935] [2025-03-08 14:04:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:05,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:04:05,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:04:05,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:05,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:05,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:05,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956516935] [2025-03-08 14:04:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956516935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:05,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:04:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3300108] [2025-03-08 14:04:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:05,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:04:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:05,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:04:05,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:04:05,596 INFO L87 Difference]: Start difference. First operand 341 states and 520 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:06,406 INFO L93 Difference]: Finished difference Result 1345 states and 2052 transitions. [2025-03-08 14:04:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:04:06,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-08 14:04:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:06,412 INFO L225 Difference]: With dead ends: 1345 [2025-03-08 14:04:06,415 INFO L226 Difference]: Without dead ends: 1007 [2025-03-08 14:04:06,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:04:06,418 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 500 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:06,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 760 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:04:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-08 14:04:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 581. [2025-03-08 14:04:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 435 states have (on average 1.4) internal successors, (609), 435 states have internal predecessors, (609), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 14:04:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 889 transitions. [2025-03-08 14:04:06,515 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 889 transitions. Word has length 192 [2025-03-08 14:04:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:06,516 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 889 transitions. [2025-03-08 14:04:06,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 889 transitions. [2025-03-08 14:04:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:04:06,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:06,518 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 14:04:06,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash 979770972, now seen corresponding path program 1 times [2025-03-08 14:04:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490196702] [2025-03-08 14:04:06,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:06,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:04:06,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:04:06,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:06,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:06,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:06,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490196702] [2025-03-08 14:04:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490196702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:06,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 14:04:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370204634] [2025-03-08 14:04:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:06,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:04:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:06,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:04:06,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:04:06,782 INFO L87 Difference]: Start difference. First operand 581 states and 889 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:07,101 INFO L93 Difference]: Finished difference Result 1202 states and 1838 transitions. [2025-03-08 14:04:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:04:07,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-03-08 14:04:07,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:07,106 INFO L225 Difference]: With dead ends: 1202 [2025-03-08 14:04:07,106 INFO L226 Difference]: Without dead ends: 624 [2025-03-08 14:04:07,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:04:07,108 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 106 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:07,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 524 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:04:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-08 14:04:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 532. [2025-03-08 14:04:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 386 states have (on average 1.3860103626943006) internal successors, (535), 386 states have internal predecessors, (535), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-08 14:04:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2025-03-08 14:04:07,185 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 192 [2025-03-08 14:04:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:07,186 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2025-03-08 14:04:07,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2025-03-08 14:04:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 14:04:07,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:07,187 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:07,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 14:04:07,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:07,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 154919042, now seen corresponding path program 1 times [2025-03-08 14:04:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:07,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681001763] [2025-03-08 14:04:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:07,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 14:04:07,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 14:04:07,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:07,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681001763] [2025-03-08 14:04:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681001763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:04:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650224691] [2025-03-08 14:04:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 14:04:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:07,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 14:04:07,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 14:04:07,425 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:07,767 INFO L93 Difference]: Finished difference Result 1442 states and 2211 transitions. [2025-03-08 14:04:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:04:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-03-08 14:04:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:07,773 INFO L225 Difference]: With dead ends: 1442 [2025-03-08 14:04:07,773 INFO L226 Difference]: Without dead ends: 978 [2025-03-08 14:04:07,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:04:07,776 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 166 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:07,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 445 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:04:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-03-08 14:04:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2025-03-08 14:04:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.376750700280112) internal successors, (983), 714 states have internal predecessors, (983), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 14:04:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1487 transitions. [2025-03-08 14:04:07,896 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1487 transitions. Word has length 193 [2025-03-08 14:04:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:07,897 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1487 transitions. [2025-03-08 14:04:07,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1487 transitions. [2025-03-08 14:04:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 14:04:07,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:07,899 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:07,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 14:04:07,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:07,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash -745319271, now seen corresponding path program 1 times [2025-03-08 14:04:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524361726] [2025-03-08 14:04:07,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:07,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 14:04:07,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 14:04:07,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:07,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524361726] [2025-03-08 14:04:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524361726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:04:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633412746] [2025-03-08 14:04:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:07,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:04:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:07,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:04:07,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:04:07,998 INFO L87 Difference]: Start difference. First operand 976 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:08,144 INFO L93 Difference]: Finished difference Result 1962 states and 2994 transitions. [2025-03-08 14:04:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:04:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-03-08 14:04:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:08,150 INFO L225 Difference]: With dead ends: 1962 [2025-03-08 14:04:08,150 INFO L226 Difference]: Without dead ends: 1056 [2025-03-08 14:04:08,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:04:08,153 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:08,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 14:04:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-08 14:04:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 976. [2025-03-08 14:04:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.3711484593837535) internal successors, (979), 714 states have internal predecessors, (979), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 14:04:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1483 transitions. [2025-03-08 14:04:08,262 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1483 transitions. Word has length 194 [2025-03-08 14:04:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:08,263 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1483 transitions. [2025-03-08 14:04:08,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1483 transitions. [2025-03-08 14:04:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 14:04:08,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:08,265 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:08,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 14:04:08,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 495733117, now seen corresponding path program 1 times [2025-03-08 14:04:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882833406] [2025-03-08 14:04:08,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:08,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:04:08,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:04:08,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:08,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-08 14:04:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882833406] [2025-03-08 14:04:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882833406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:04:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579961331] [2025-03-08 14:04:08,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:08,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:04:08,875 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-08 14:04:08,877 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-08 14:04:08,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:04:08,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:04:08,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:08,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:08,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:04:09,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:04:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:09,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:04:09,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579961331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:09,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:04:09,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-08 14:04:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047973611] [2025-03-08 14:04:09,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:09,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:04:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:09,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:04:09,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:04:09,086 INFO L87 Difference]: Start difference. First operand 976 states and 1483 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:09,514 INFO L93 Difference]: Finished difference Result 2604 states and 3962 transitions. [2025-03-08 14:04:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 14:04:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-03-08 14:04:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:09,524 INFO L225 Difference]: With dead ends: 2604 [2025-03-08 14:04:09,524 INFO L226 Difference]: Without dead ends: 1694 [2025-03-08 14:04:09,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:04:09,528 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 272 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:09,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 940 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:04:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-03-08 14:04:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1422. [2025-03-08 14:04:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1044 states have (on average 1.353448275862069) internal successors, (1413), 1044 states have internal predecessors, (1413), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-08 14:04:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2141 transitions. [2025-03-08 14:04:09,685 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2141 transitions. Word has length 195 [2025-03-08 14:04:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:09,685 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2141 transitions. [2025-03-08 14:04:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2141 transitions. [2025-03-08 14:04:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 14:04:09,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:09,689 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:09,696 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-08 14:04:09,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 14:04:09,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:09,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:09,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1051160101, now seen corresponding path program 1 times [2025-03-08 14:04:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:09,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436624294] [2025-03-08 14:04:09,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:09,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:09,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:04:09,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:04:09,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:09,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:10,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436624294] [2025-03-08 14:04:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436624294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:10,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:10,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 14:04:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357019599] [2025-03-08 14:04:10,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:10,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:04:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:04:10,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:04:10,444 INFO L87 Difference]: Start difference. First operand 1422 states and 2141 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:11,717 INFO L93 Difference]: Finished difference Result 2875 states and 4323 transitions. [2025-03-08 14:04:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 14:04:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-03-08 14:04:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:11,730 INFO L225 Difference]: With dead ends: 2875 [2025-03-08 14:04:11,730 INFO L226 Difference]: Without dead ends: 1523 [2025-03-08 14:04:11,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 14:04:11,736 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 375 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:11,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 862 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 14:04:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-08 14:04:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1423. [2025-03-08 14:04:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1045 states have (on average 1.35311004784689) internal successors, (1414), 1045 states have internal predecessors, (1414), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-03-08 14:04:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2142 transitions. [2025-03-08 14:04:11,933 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2142 transitions. Word has length 195 [2025-03-08 14:04:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:11,934 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2142 transitions. [2025-03-08 14:04:11,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2142 transitions. [2025-03-08 14:04:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:04:11,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:11,937 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:11,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 14:04:11,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:11,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:11,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1788711873, now seen corresponding path program 1 times [2025-03-08 14:04:11,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:11,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831804266] [2025-03-08 14:04:11,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:11,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:04:12,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:04:12,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-08 14:04:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831804266] [2025-03-08 14:04:12,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831804266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:04:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419296689] [2025-03-08 14:04:12,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:12,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:12,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:04:12,437 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-08 14:04:12,448 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-08 14:04:12,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:04:12,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:04:12,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:12,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:12,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 14:04:12,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:04:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2025-03-08 14:04:12,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:04:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-03-08 14:04:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419296689] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:04:12,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:04:12,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-08 14:04:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257635340] [2025-03-08 14:04:12,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:04:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 14:04:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:12,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 14:04:12,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-08 14:04:12,991 INFO L87 Difference]: Start difference. First operand 1423 states and 2142 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 14:04:13,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:13,464 INFO L93 Difference]: Finished difference Result 2227 states and 3281 transitions. [2025-03-08 14:04:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 14:04:13,464 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-03-08 14:04:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:13,471 INFO L225 Difference]: With dead ends: 2227 [2025-03-08 14:04:13,471 INFO L226 Difference]: Without dead ends: 874 [2025-03-08 14:04:13,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2025-03-08 14:04:13,475 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 298 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:13,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 317 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:04:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-08 14:04:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2025-03-08 14:04:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 602 states have (on average 1.313953488372093) internal successors, (791), 602 states have internal predecessors, (791), 196 states have call successors, (196), 21 states have call predecessors, (196), 21 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-08 14:04:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1183 transitions. [2025-03-08 14:04:13,612 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1183 transitions. Word has length 196 [2025-03-08 14:04:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:13,613 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1183 transitions. [2025-03-08 14:04:13,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 14:04:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1183 transitions. [2025-03-08 14:04:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:04:13,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:13,615 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:13,622 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-08 14:04:13,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:13,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:13,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash 952555931, now seen corresponding path program 1 times [2025-03-08 14:04:13,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000009675] [2025-03-08 14:04:13,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:13,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:04:13,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:04:13,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:13,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000009675] [2025-03-08 14:04:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000009675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:04:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141906926] [2025-03-08 14:04:14,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:14,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:04:14,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:14,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:04:14,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:04:14,038 INFO L87 Difference]: Start difference. First operand 820 states and 1183 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:14,909 INFO L93 Difference]: Finished difference Result 1952 states and 2815 transitions. [2025-03-08 14:04:14,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 14:04:14,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-03-08 14:04:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:14,917 INFO L225 Difference]: With dead ends: 1952 [2025-03-08 14:04:14,918 INFO L226 Difference]: Without dead ends: 1210 [2025-03-08 14:04:14,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 14:04:14,920 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 321 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:14,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 731 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:04:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-03-08 14:04:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 979. [2025-03-08 14:04:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 730 states have (on average 1.3136986301369864) internal successors, (959), 730 states have internal predecessors, (959), 224 states have call successors, (224), 24 states have call predecessors, (224), 24 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 14:04:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1407 transitions. [2025-03-08 14:04:15,059 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1407 transitions. Word has length 196 [2025-03-08 14:04:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:15,061 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1407 transitions. [2025-03-08 14:04:15,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1407 transitions. [2025-03-08 14:04:15,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 14:04:15,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:15,062 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:15,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 14:04:15,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:15,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1954499850, now seen corresponding path program 1 times [2025-03-08 14:04:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:15,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017083612] [2025-03-08 14:04:15,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:15,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:15,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:04:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:04:15,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:15,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 14:04:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017083612] [2025-03-08 14:04:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017083612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:04:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117622591] [2025-03-08 14:04:15,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:15,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:04:15,854 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-08 14:04:15,856 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-08 14:04:15,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 14:04:15,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 14:04:15,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:15,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:15,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 14:04:15,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:04:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:17,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:04:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117622591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:04:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-08 14:04:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146424362] [2025-03-08 14:04:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:17,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 14:04:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:17,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 14:04:17,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-03-08 14:04:17,400 INFO L87 Difference]: Start difference. First operand 979 states and 1407 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:18,235 INFO L93 Difference]: Finished difference Result 2083 states and 2982 transitions. [2025-03-08 14:04:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 14:04:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-03-08 14:04:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:18,241 INFO L225 Difference]: With dead ends: 2083 [2025-03-08 14:04:18,242 INFO L226 Difference]: Without dead ends: 1182 [2025-03-08 14:04:18,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-08 14:04:18,245 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 91 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:18,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 680 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 14:04:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-08 14:04:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1035. [2025-03-08 14:04:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 786 states have (on average 1.316793893129771) internal successors, (1035), 786 states have internal predecessors, (1035), 224 states have call successors, (224), 24 states have call predecessors, (224), 24 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 14:04:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1483 transitions. [2025-03-08 14:04:18,387 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1483 transitions. Word has length 196 [2025-03-08 14:04:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:18,388 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1483 transitions. [2025-03-08 14:04:18,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1483 transitions. [2025-03-08 14:04:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 14:04:18,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:18,391 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:18,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:04:18,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:18,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:18,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash 918529735, now seen corresponding path program 1 times [2025-03-08 14:04:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102384205] [2025-03-08 14:04:18,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:18,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:18,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 14:04:18,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 14:04:18,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:18,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 14:04:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:04:19,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102384205] [2025-03-08 14:04:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102384205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:04:19,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:04:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:04:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168585902] [2025-03-08 14:04:19,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:04:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:04:19,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:04:19,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:04:19,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:04:19,037 INFO L87 Difference]: Start difference. First operand 1035 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:04:19,782 INFO L93 Difference]: Finished difference Result 2154 states and 3084 transitions. [2025-03-08 14:04:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:04:19,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-03-08 14:04:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:04:19,790 INFO L225 Difference]: With dead ends: 2154 [2025-03-08 14:04:19,790 INFO L226 Difference]: Without dead ends: 1253 [2025-03-08 14:04:19,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:04:19,793 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 323 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 14:04:19,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 567 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 14:04:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-03-08 14:04:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1005. [2025-03-08 14:04:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 756 states have (on average 1.3082010582010581) internal successors, (989), 756 states have internal predecessors, (989), 224 states have call successors, (224), 24 states have call predecessors, (224), 24 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2025-03-08 14:04:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1437 transitions. [2025-03-08 14:04:19,928 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1437 transitions. Word has length 197 [2025-03-08 14:04:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:04:19,929 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1437 transitions. [2025-03-08 14:04:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 14:04:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1437 transitions. [2025-03-08 14:04:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 14:04:19,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:04:19,931 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:04:19,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 14:04:19,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:04:19,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:04:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1649393997, now seen corresponding path program 1 times [2025-03-08 14:04:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:04:19,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121723420] [2025-03-08 14:04:19,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:04:19,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 14:04:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 14:04:19,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:19,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:04:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77342314] [2025-03-08 14:04:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:04:19,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:04:20,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:04:20,001 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-08 14:04:20,003 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-08 14:04:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 14:04:20,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 14:04:20,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:04:20,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:04:20,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 14:04:20,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:04:45,465 WARN L286 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 14:04:57,763 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)