./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label52.c -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 eceda023c7394c88c46221fb5ed6b67ae6e1976efca78e0b148b1f17e3b2b45b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:45:13,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:45:13,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:45:13,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:45:13,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:45:13,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:45:13,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:45:13,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:45:13,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:45:13,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:45:13,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:45:13,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:45:13,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:45:13,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:45:13,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:45:13,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:45:13,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:45:13,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:45:13,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:45:13,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:45:13,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:45:13,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:45:13,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:45:13,729 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 -> eceda023c7394c88c46221fb5ed6b67ae6e1976efca78e0b148b1f17e3b2b45b [2025-03-03 10:45:13,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:45:13,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:45:13,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:45:13,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:45:13,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:45:13,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label52.c [2025-03-03 10:45:15,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77f746fe/381db2f669d944588473c52cda688e0b/FLAG42258e18d [2025-03-03 10:45:15,446 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:45:15,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label52.c [2025-03-03 10:45:15,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77f746fe/381db2f669d944588473c52cda688e0b/FLAG42258e18d [2025-03-03 10:45:15,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77f746fe/381db2f669d944588473c52cda688e0b [2025-03-03 10:45:15,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:45:15,629 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:45:15,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:45:15,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:45:15,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:45:15,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:45:15" (1/1) ... [2025-03-03 10:45:15,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d3e2eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:15, skipping insertion in model container [2025-03-03 10:45:15,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:45:15" (1/1) ... [2025-03-03 10:45:15,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:45:15,927 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/eca-rers2012/Problem13_label52.c[9091,9104] [2025-03-03 10:45:16,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:45:16,498 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:45:16,520 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/eca-rers2012/Problem13_label52.c[9091,9104] [2025-03-03 10:45:16,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:45:16,833 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:45:16,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16 WrapperNode [2025-03-03 10:45:16,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:45:16,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:45:16,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:45:16,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:45:16,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:16,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,273 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:45:17,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:45:17,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:45:17,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:45:17,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:45:17,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,567 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:45:17,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,781 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:45:17,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:45:17,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:45:17,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:45:17,907 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (1/1) ... [2025-03-03 10:45:17,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:45:17,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:17,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:45:17,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:45:17,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:45:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:45:17,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:45:17,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:45:18,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:45:18,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:45:22,189 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:45:22,190 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:45:22,190 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:45:22,369 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:45:22,370 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:45:22,406 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:45:22,406 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:45:22,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:45:22 BoogieIcfgContainer [2025-03-03 10:45:22,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:45:22,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:45:22,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:45:22,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:45:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:45:15" (1/3) ... [2025-03-03 10:45:22,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c02551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:45:22, skipping insertion in model container [2025-03-03 10:45:22,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:45:16" (2/3) ... [2025-03-03 10:45:22,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c02551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:45:22, skipping insertion in model container [2025-03-03 10:45:22,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:45:22" (3/3) ... [2025-03-03 10:45:22,414 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label52.c [2025-03-03 10:45:22,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:45:22,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label52.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:45:22,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:45:22,514 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;@1193c988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:45:22,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:45:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 10:45:22,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:22,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:22,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:22,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1296972967, now seen corresponding path program 1 times [2025-03-03 10:45:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002764796] [2025-03-03 10:45:22,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:22,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 10:45:22,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 10:45:22,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:22,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:23,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:23,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002764796] [2025-03-03 10:45:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002764796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:23,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:23,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:23,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339256724] [2025-03-03 10:45:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:23,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:23,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:23,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:23,076 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:28,492 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-03-03 10:45:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:28,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-03 10:45:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:28,517 INFO L225 Difference]: With dead ends: 3829 [2025-03-03 10:45:28,518 INFO L226 Difference]: Without dead ends: 2664 [2025-03-03 10:45:28,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:45:28,524 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2665 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:28,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 10:45:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-03 10:45:28,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-03-03 10:45:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-03-03 10:45:28,635 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 64 [2025-03-03 10:45:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-03-03 10:45:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-03-03 10:45:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 10:45:28,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:28,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:28,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:45:28,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:28,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -498737573, now seen corresponding path program 1 times [2025-03-03 10:45:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408274799] [2025-03-03 10:45:28,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:28,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 10:45:28,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 10:45:28,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:28,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:28,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408274799] [2025-03-03 10:45:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408274799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716449448] [2025-03-03 10:45:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:28,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:28,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:28,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:28,950 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:34,384 INFO L93 Difference]: Finished difference Result 7866 states and 12670 transitions. [2025-03-03 10:45:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:34,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2025-03-03 10:45:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:34,403 INFO L225 Difference]: With dead ends: 7866 [2025-03-03 10:45:34,404 INFO L226 Difference]: Without dead ends: 5992 [2025-03-03 10:45:34,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:34,407 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 1694 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 5285 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 6127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 5285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:34,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 1070 Invalid, 6127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 5285 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 10:45:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-03 10:45:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5859. [2025-03-03 10:45:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 5858 states have (on average 1.4453738477296005) internal successors, (8467), 5858 states have internal predecessors, (8467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 8467 transitions. [2025-03-03 10:45:34,493 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 8467 transitions. Word has length 189 [2025-03-03 10:45:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:34,494 INFO L471 AbstractCegarLoop]: Abstraction has 5859 states and 8467 transitions. [2025-03-03 10:45:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 8467 transitions. [2025-03-03 10:45:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 10:45:34,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:34,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:34,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:45:34,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash 81921628, now seen corresponding path program 1 times [2025-03-03 10:45:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:34,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884779989] [2025-03-03 10:45:34,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:34,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 10:45:34,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 10:45:34,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:34,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:45:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884779989] [2025-03-03 10:45:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884779989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:34,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:34,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226825346] [2025-03-03 10:45:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:34,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:34,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:34,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:34,714 INFO L87 Difference]: Start difference. First operand 5859 states and 8467 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:37,728 INFO L93 Difference]: Finished difference Result 15687 states and 23393 transitions. [2025-03-03 10:45:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:37,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2025-03-03 10:45:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:37,762 INFO L225 Difference]: With dead ends: 15687 [2025-03-03 10:45:37,762 INFO L226 Difference]: Without dead ends: 10617 [2025-03-03 10:45:37,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:37,772 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 919 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:37,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 919 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 10:45:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10617 states. [2025-03-03 10:45:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10617 to 10608. [2025-03-03 10:45:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3553313849344772) internal successors, (14376), 10607 states have internal predecessors, (14376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 14376 transitions. [2025-03-03 10:45:37,998 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 14376 transitions. Word has length 231 [2025-03-03 10:45:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:37,998 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 14376 transitions. [2025-03-03 10:45:37,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 14376 transitions. [2025-03-03 10:45:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 10:45:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:38,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:45:38,008 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1480010773, now seen corresponding path program 1 times [2025-03-03 10:45:38,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773693292] [2025-03-03 10:45:38,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 10:45:38,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 10:45:38,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:45:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:38,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773693292] [2025-03-03 10:45:38,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773693292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:38,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:38,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664025800] [2025-03-03 10:45:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:38,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:38,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:38,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:38,441 INFO L87 Difference]: Start difference. First operand 10608 states and 14376 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:41,197 INFO L93 Difference]: Finished difference Result 28351 states and 39246 transitions. [2025-03-03 10:45:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:41,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2025-03-03 10:45:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:41,243 INFO L225 Difference]: With dead ends: 28351 [2025-03-03 10:45:41,244 INFO L226 Difference]: Without dead ends: 18532 [2025-03-03 10:45:41,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:41,252 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 909 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:41,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 615 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2025-03-03 10:45:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 18523. [2025-03-03 10:45:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18523 states, 18522 states have (on average 1.3253428355469172) internal successors, (24548), 18522 states have internal predecessors, (24548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18523 states to 18523 states and 24548 transitions. [2025-03-03 10:45:41,509 INFO L78 Accepts]: Start accepts. Automaton has 18523 states and 24548 transitions. Word has length 245 [2025-03-03 10:45:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:41,509 INFO L471 AbstractCegarLoop]: Abstraction has 18523 states and 24548 transitions. [2025-03-03 10:45:41,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:41,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18523 states and 24548 transitions. [2025-03-03 10:45:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 10:45:41,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:41,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:41,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:45:41,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:41,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -172126211, now seen corresponding path program 1 times [2025-03-03 10:45:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5210043] [2025-03-03 10:45:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:41,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 10:45:41,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 10:45:41,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:41,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 10:45:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:41,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5210043] [2025-03-03 10:45:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5210043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:41,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:41,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969240582] [2025-03-03 10:45:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:41,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:41,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:41,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:41,758 INFO L87 Difference]: Start difference. First operand 18523 states and 24548 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:44,526 INFO L93 Difference]: Finished difference Result 51208 states and 68761 transitions. [2025-03-03 10:45:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:44,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2025-03-03 10:45:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:44,574 INFO L225 Difference]: With dead ends: 51208 [2025-03-03 10:45:44,574 INFO L226 Difference]: Without dead ends: 33474 [2025-03-03 10:45:44,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:44,593 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 870 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 870 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:44,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [870 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33474 states. [2025-03-03 10:45:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33474 to 32684. [2025-03-03 10:45:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32684 states, 32683 states have (on average 1.2454181072728943) internal successors, (40704), 32683 states have internal predecessors, (40704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 40704 transitions. [2025-03-03 10:45:45,185 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 40704 transitions. Word has length 257 [2025-03-03 10:45:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:45,186 INFO L471 AbstractCegarLoop]: Abstraction has 32684 states and 40704 transitions. [2025-03-03 10:45:45,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 40704 transitions. [2025-03-03 10:45:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 10:45:45,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:45,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:45,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:45:45,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:45,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:45,190 INFO L85 PathProgramCache]: Analyzing trace with hash -61936915, now seen corresponding path program 1 times [2025-03-03 10:45:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984623879] [2025-03-03 10:45:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:45,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 10:45:45,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 10:45:45,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984623879] [2025-03-03 10:45:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984623879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092322781] [2025-03-03 10:45:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:45,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:45,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:45,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:45,438 INFO L87 Difference]: Start difference. First operand 32684 states and 40704 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:50,391 INFO L93 Difference]: Finished difference Result 87628 states and 111186 transitions. [2025-03-03 10:45:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-03-03 10:45:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:50,558 INFO L225 Difference]: With dead ends: 87628 [2025-03-03 10:45:50,558 INFO L226 Difference]: Without dead ends: 55733 [2025-03-03 10:45:50,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:50,580 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 1734 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6142 mSolverCounterSat, 1128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 7270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1128 IncrementalHoareTripleChecker+Valid, 6142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:50,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 846 Invalid, 7270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1128 Valid, 6142 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 10:45:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55733 states. [2025-03-03 10:45:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55733 to 54816. [2025-03-03 10:45:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54816 states, 54815 states have (on average 1.2438566085925384) internal successors, (68182), 54815 states have internal predecessors, (68182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54816 states to 54816 states and 68182 transitions. [2025-03-03 10:45:51,450 INFO L78 Accepts]: Start accepts. Automaton has 54816 states and 68182 transitions. Word has length 261 [2025-03-03 10:45:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:51,451 INFO L471 AbstractCegarLoop]: Abstraction has 54816 states and 68182 transitions. [2025-03-03 10:45:51,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 54816 states and 68182 transitions. [2025-03-03 10:45:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 10:45:51,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:51,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:51,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:45:51,455 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1246581650, now seen corresponding path program 1 times [2025-03-03 10:45:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15599786] [2025-03-03 10:45:51,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:51,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 10:45:51,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 10:45:51,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:51,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15599786] [2025-03-03 10:45:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15599786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36951598] [2025-03-03 10:45:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:51,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:51,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:51,816 INFO L87 Difference]: Start difference. First operand 54816 states and 68182 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:54,762 INFO L93 Difference]: Finished difference Result 152927 states and 191818 transitions. [2025-03-03 10:45:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:54,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 271 [2025-03-03 10:45:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:54,901 INFO L225 Difference]: With dead ends: 152927 [2025-03-03 10:45:54,901 INFO L226 Difference]: Without dead ends: 98900 [2025-03-03 10:45:54,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:54,938 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 816 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 896 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:54,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1015 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [896 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:45:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98900 states. [2025-03-03 10:45:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98900 to 95739. [2025-03-03 10:45:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95739 states, 95738 states have (on average 1.1951158369717354) internal successors, (114418), 95738 states have internal predecessors, (114418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95739 states to 95739 states and 114418 transitions. [2025-03-03 10:45:56,069 INFO L78 Accepts]: Start accepts. Automaton has 95739 states and 114418 transitions. Word has length 271 [2025-03-03 10:45:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:56,070 INFO L471 AbstractCegarLoop]: Abstraction has 95739 states and 114418 transitions. [2025-03-03 10:45:56,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 95739 states and 114418 transitions. [2025-03-03 10:45:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-03 10:45:56,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:56,080 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:56,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:45:56,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 50664455, now seen corresponding path program 1 times [2025-03-03 10:45:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861025332] [2025-03-03 10:45:56,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-03 10:45:56,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-03 10:45:56,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 10:45:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861025332] [2025-03-03 10:45:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861025332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:56,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:56,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462237965] [2025-03-03 10:45:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:56,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:56,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:56,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:56,469 INFO L87 Difference]: Start difference. First operand 95739 states and 114418 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:59,863 INFO L93 Difference]: Finished difference Result 221422 states and 263434 transitions. [2025-03-03 10:45:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2025-03-03 10:45:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:00,004 INFO L225 Difference]: With dead ends: 221422 [2025-03-03 10:46:00,005 INFO L226 Difference]: Without dead ends: 126472 [2025-03-03 10:46:00,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:00,051 INFO L435 NwaCegarLoop]: 1859 mSDtfsCounter, 752 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:00,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 2001 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:46:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126472 states. [2025-03-03 10:46:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126472 to 126434. [2025-03-03 10:46:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126434 states, 126433 states have (on average 1.1685873150206039) internal successors, (147748), 126433 states have internal predecessors, (147748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126434 states to 126434 states and 147748 transitions. [2025-03-03 10:46:01,192 INFO L78 Accepts]: Start accepts. Automaton has 126434 states and 147748 transitions. Word has length 361 [2025-03-03 10:46:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:01,193 INFO L471 AbstractCegarLoop]: Abstraction has 126434 states and 147748 transitions. [2025-03-03 10:46:01,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 126434 states and 147748 transitions. [2025-03-03 10:46:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-03 10:46:01,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:01,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:46:01,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -165335496, now seen corresponding path program 1 times [2025-03-03 10:46:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996215866] [2025-03-03 10:46:01,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:01,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-03 10:46:01,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-03 10:46:01,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:01,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 10:46:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996215866] [2025-03-03 10:46:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996215866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134448030] [2025-03-03 10:46:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:01,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:01,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:01,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:01,335 INFO L87 Difference]: Start difference. First operand 126434 states and 147748 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:04,630 INFO L93 Difference]: Finished difference Result 258349 states and 300912 transitions. [2025-03-03 10:46:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-03-03 10:46:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:04,778 INFO L225 Difference]: With dead ends: 258349 [2025-03-03 10:46:04,778 INFO L226 Difference]: Without dead ends: 128764 [2025-03-03 10:46:04,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:04,838 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 1036 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:04,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1651 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:46:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128764 states. [2025-03-03 10:46:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128764 to 120875. [2025-03-03 10:46:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120875 states, 120874 states have (on average 1.1136720882902857) internal successors, (134614), 120874 states have internal predecessors, (134614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120875 states to 120875 states and 134614 transitions. [2025-03-03 10:46:06,182 INFO L78 Accepts]: Start accepts. Automaton has 120875 states and 134614 transitions. Word has length 381 [2025-03-03 10:46:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:06,182 INFO L471 AbstractCegarLoop]: Abstraction has 120875 states and 134614 transitions. [2025-03-03 10:46:06,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120875 states and 134614 transitions. [2025-03-03 10:46:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-03 10:46:06,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:06,187 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:06,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:46:06,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:06,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash 158348422, now seen corresponding path program 1 times [2025-03-03 10:46:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:06,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561210803] [2025-03-03 10:46:06,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:06,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 10:46:06,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 10:46:06,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:06,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 295 proven. 110 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 10:46:07,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561210803] [2025-03-03 10:46:07,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561210803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510706300] [2025-03-03 10:46:07,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:07,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:07,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:07,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:07,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:46:07,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 10:46:07,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 10:46:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:07,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:07,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:07,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-03 10:46:07,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510706300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:07,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:07,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406396970] [2025-03-03 10:46:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:07,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:07,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:07,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:07,692 INFO L87 Difference]: Start difference. First operand 120875 states and 134614 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:10,507 INFO L93 Difference]: Finished difference Result 238597 states and 265627 transitions. [2025-03-03 10:46:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2025-03-03 10:46:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:10,645 INFO L225 Difference]: With dead ends: 238597 [2025-03-03 10:46:10,645 INFO L226 Difference]: Without dead ends: 118511 [2025-03-03 10:46:10,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:10,689 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 1113 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:10,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1424 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:46:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118511 states. [2025-03-03 10:46:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118511 to 117719. [2025-03-03 10:46:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117719 states, 117718 states have (on average 1.0858322431573761) internal successors, (127822), 117718 states have internal predecessors, (127822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117719 states to 117719 states and 127822 transitions. [2025-03-03 10:46:11,911 INFO L78 Accepts]: Start accepts. Automaton has 117719 states and 127822 transitions. Word has length 390 [2025-03-03 10:46:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:11,911 INFO L471 AbstractCegarLoop]: Abstraction has 117719 states and 127822 transitions. [2025-03-03 10:46:11,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117719 states and 127822 transitions. [2025-03-03 10:46:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-03 10:46:11,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:11,916 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:11,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:46:12,117 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,SelfDestructingSolverStorable9 [2025-03-03 10:46:12,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:12,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash 411334804, now seen corresponding path program 1 times [2025-03-03 10:46:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297770421] [2025-03-03 10:46:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:12,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-03 10:46:12,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-03 10:46:12,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:12,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:46:12,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:12,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297770421] [2025-03-03 10:46:12,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297770421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:12,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:12,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:12,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352268447] [2025-03-03 10:46:12,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:12,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:12,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:12,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:12,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:12,273 INFO L87 Difference]: Start difference. First operand 117719 states and 127822 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:15,942 INFO L93 Difference]: Finished difference Result 269284 states and 294417 transitions. [2025-03-03 10:46:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:15,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 420 [2025-03-03 10:46:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:16,105 INFO L225 Difference]: With dead ends: 269284 [2025-03-03 10:46:16,105 INFO L226 Difference]: Without dead ends: 152354 [2025-03-03 10:46:16,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:16,158 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 882 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 934 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 934 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:16,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 884 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [934 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:46:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152354 states. [2025-03-03 10:46:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152354 to 149974. [2025-03-03 10:46:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149974 states, 149973 states have (on average 1.0892827375594274) internal successors, (163363), 149973 states have internal predecessors, (163363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149974 states to 149974 states and 163363 transitions. [2025-03-03 10:46:17,534 INFO L78 Accepts]: Start accepts. Automaton has 149974 states and 163363 transitions. Word has length 420 [2025-03-03 10:46:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:17,534 INFO L471 AbstractCegarLoop]: Abstraction has 149974 states and 163363 transitions. [2025-03-03 10:46:17,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 149974 states and 163363 transitions. [2025-03-03 10:46:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-03 10:46:17,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:17,542 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:17,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:46:17,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:17,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash 282781894, now seen corresponding path program 1 times [2025-03-03 10:46:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302346271] [2025-03-03 10:46:17,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-03 10:46:17,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-03 10:46:17,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:17,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:46:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302346271] [2025-03-03 10:46:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302346271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:18,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844159929] [2025-03-03 10:46:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:18,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:18,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:18,026 INFO L87 Difference]: Start difference. First operand 149974 states and 163363 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:21,495 INFO L93 Difference]: Finished difference Result 329865 states and 361255 transitions. [2025-03-03 10:46:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:21,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 458 [2025-03-03 10:46:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:21,711 INFO L225 Difference]: With dead ends: 329865 [2025-03-03 10:46:21,711 INFO L226 Difference]: Without dead ends: 179893 [2025-03-03 10:46:21,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:21,795 INFO L435 NwaCegarLoop]: 1737 mSDtfsCounter, 788 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2518 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:21,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1880 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2518 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:46:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179893 states. [2025-03-03 10:46:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179893 to 176729. [2025-03-03 10:46:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176729 states, 176728 states have (on average 1.078142682540401) internal successors, (190538), 176728 states have internal predecessors, (190538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176729 states to 176729 states and 190538 transitions. [2025-03-03 10:46:23,884 INFO L78 Accepts]: Start accepts. Automaton has 176729 states and 190538 transitions. Word has length 458 [2025-03-03 10:46:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:23,885 INFO L471 AbstractCegarLoop]: Abstraction has 176729 states and 190538 transitions. [2025-03-03 10:46:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 176729 states and 190538 transitions. [2025-03-03 10:46:23,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-03 10:46:23,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:23,895 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:23,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:46:23,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:23,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash -245666653, now seen corresponding path program 1 times [2025-03-03 10:46:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:23,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470530604] [2025-03-03 10:46:23,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:23,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-03 10:46:23,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-03 10:46:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 364 proven. 110 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 10:46:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470530604] [2025-03-03 10:46:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470530604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:24,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604465314] [2025-03-03 10:46:24,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:24,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:24,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:24,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:46:24,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-03 10:46:25,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-03 10:46:25,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:25,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:25,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:25,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 423 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:46:25,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604465314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715220042] [2025-03-03 10:46:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:25,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:25,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:25,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:25,256 INFO L87 Difference]: Start difference. First operand 176729 states and 190538 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:28,518 INFO L93 Difference]: Finished difference Result 343194 states and 371360 transitions. [2025-03-03 10:46:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 494 [2025-03-03 10:46:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:28,727 INFO L225 Difference]: With dead ends: 343194 [2025-03-03 10:46:28,727 INFO L226 Difference]: Without dead ends: 186935 [2025-03-03 10:46:28,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:28,769 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1128 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:28,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 367 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:46:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186935 states. [2025-03-03 10:46:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186935 to 186935. [2025-03-03 10:46:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186935 states, 186934 states have (on average 1.0723463896348444) internal successors, (200458), 186934 states have internal predecessors, (200458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186935 states to 186935 states and 200458 transitions. [2025-03-03 10:46:30,663 INFO L78 Accepts]: Start accepts. Automaton has 186935 states and 200458 transitions. Word has length 494 [2025-03-03 10:46:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:30,663 INFO L471 AbstractCegarLoop]: Abstraction has 186935 states and 200458 transitions. [2025-03-03 10:46:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 186935 states and 200458 transitions. [2025-03-03 10:46:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-03 10:46:30,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:30,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:30,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:46:30,874 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,SelfDestructingSolverStorable12 [2025-03-03 10:46:30,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -525293319, now seen corresponding path program 1 times [2025-03-03 10:46:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365388439] [2025-03-03 10:46:30,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:30,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:46:30,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:46:30,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:30,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 364 proven. 110 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 10:46:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365388439] [2025-03-03 10:46:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365388439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033762352] [2025-03-03 10:46:32,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:32,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:32,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:46:32,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 10:46:32,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 10:46:32,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:32,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:32,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:46:32,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-03 10:46:32,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033762352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:32,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:32,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994227900] [2025-03-03 10:46:32,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:32,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:32,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:32,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:32,316 INFO L87 Difference]: Start difference. First operand 186935 states and 200458 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)