./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.05.cil.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/systemc/transmitter.05.cil.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 d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:45:05,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:45:05,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:45:05,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:45:05,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:45:05,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:45:05,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:45:05,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:45:05,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:45:05,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:45:05,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:45:05,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:45:05,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:45:05,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:45:05,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:45:05,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:45:05,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:45:05,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:45:05,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:45:05,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:45:05,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:45:05,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:45:05,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:45:05,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:45:05,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:45:05,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:45:05,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:45:05,669 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 -> d8722862ca37b1ee13dec8b9e420cd40ba7901837b8f3b6258499da6e8a2ca6f [2025-03-03 14:45:05,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:45:05,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:45:05,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:45:05,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:45:05,909 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:45:05,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.05.cil.c [2025-03-03 14:45:07,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7f1fae6d/54caed14570148a3a990fe7d2deffabf/FLAGb366aa4ae [2025-03-03 14:45:07,355 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:45:07,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c [2025-03-03 14:45:07,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7f1fae6d/54caed14570148a3a990fe7d2deffabf/FLAGb366aa4ae [2025-03-03 14:45:07,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7f1fae6d/54caed14570148a3a990fe7d2deffabf [2025-03-03 14:45:07,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:45:07,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:45:07,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:45:07,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:45:07,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:45:07,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628c46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07, skipping insertion in model container [2025-03-03 14:45:07,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:45:07,576 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/systemc/transmitter.05.cil.c[706,719] [2025-03-03 14:45:07,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:45:07,647 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:45:07,655 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/systemc/transmitter.05.cil.c[706,719] [2025-03-03 14:45:07,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:45:07,700 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:45:07,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07 WrapperNode [2025-03-03 14:45:07,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:45:07,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:45:07,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:45:07,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:45:07,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,735 INFO L138 Inliner]: procedures = 38, calls = 45, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 419 [2025-03-03 14:45:07,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:45:07,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:45:07,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:45:07,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:45:07,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,745 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,755 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 14:45:07,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:45:07,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:45:07,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:45:07,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:45:07,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (1/1) ... [2025-03-03 14:45:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:45:07,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:45:07,803 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 14:45:07,805 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 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:45:07,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:45:07,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:45:07,885 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:45:07,887 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:45:08,294 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-03 14:45:08,295 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:45:08,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:45:08,309 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:45:08,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:45:08 BoogieIcfgContainer [2025-03-03 14:45:08,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:45:08,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:45:08,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:45:08,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:45:08,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:45:07" (1/3) ... [2025-03-03 14:45:08,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c823708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:45:08, skipping insertion in model container [2025-03-03 14:45:08,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:45:07" (2/3) ... [2025-03-03 14:45:08,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c823708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:45:08, skipping insertion in model container [2025-03-03 14:45:08,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:45:08" (3/3) ... [2025-03-03 14:45:08,317 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2025-03-03 14:45:08,330 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:45:08,331 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.05.cil.c that has 7 procedures, 217 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-03 14:45:08,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:45:08,396 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;@7dd096ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:45:08,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:45:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 191 states have (on average 1.5287958115183247) internal successors, (292), 193 states have internal predecessors, (292), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 14:45:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:08,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:08,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:08,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:08,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1706363935, now seen corresponding path program 1 times [2025-03-03 14:45:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:08,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035613529] [2025-03-03 14:45:08,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:08,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:08,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:08,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:08,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:08,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:08,756 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 14:45:08,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035613529] [2025-03-03 14:45:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035613529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:08,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:08,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:08,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783760511] [2025-03-03 14:45:08,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:08,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:08,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:08,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:08,781 INFO L87 Difference]: Start difference. First operand has 217 states, 191 states have (on average 1.5287958115183247) internal successors, (292), 193 states have internal predecessors, (292), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:08,841 INFO L93 Difference]: Finished difference Result 422 states and 638 transitions. [2025-03-03 14:45:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:08,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:08,854 INFO L225 Difference]: With dead ends: 422 [2025-03-03 14:45:08,854 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 14:45:08,857 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 14:45:08,859 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:08,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 314 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 14:45:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-03 14:45:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.478494623655914) internal successors, (275), 187 states have internal predecessors, (275), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 14:45:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-03-03 14:45:08,901 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 103 [2025-03-03 14:45:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:08,902 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-03-03 14:45:08,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-03-03 14:45:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:08,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:08,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:08,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:45:08,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:08,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1720614080, now seen corresponding path program 1 times [2025-03-03 14:45:08,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:08,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443044832] [2025-03-03 14:45:08,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:08,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:08,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:08,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:08,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:09,134 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 14:45:09,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:09,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443044832] [2025-03-03 14:45:09,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443044832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:09,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:09,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:09,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456400890] [2025-03-03 14:45:09,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:09,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:09,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:09,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:09,137 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:09,545 INFO L93 Difference]: Finished difference Result 625 states and 939 transitions. [2025-03-03 14:45:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:45:09,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:09,550 INFO L225 Difference]: With dead ends: 625 [2025-03-03 14:45:09,550 INFO L226 Difference]: Without dead ends: 427 [2025-03-03 14:45:09,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:09,551 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 548 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:09,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 845 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:45:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-03 14:45:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 412. [2025-03-03 14:45:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 367 states have (on average 1.4877384196185286) internal successors, (546), 369 states have internal predecessors, (546), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 14:45:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 609 transitions. [2025-03-03 14:45:09,581 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 609 transitions. Word has length 103 [2025-03-03 14:45:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 609 transitions. [2025-03-03 14:45:09,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 609 transitions. [2025-03-03 14:45:09,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:09,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:09,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:45:09,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -231157597, now seen corresponding path program 1 times [2025-03-03 14:45:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044604411] [2025-03-03 14:45:09,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:09,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:09,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:09,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:09,752 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 14:45:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044604411] [2025-03-03 14:45:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044604411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469538343] [2025-03-03 14:45:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:09,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:09,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:09,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:09,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:09,755 INFO L87 Difference]: Start difference. First operand 412 states and 609 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:09,982 INFO L93 Difference]: Finished difference Result 844 states and 1262 transitions. [2025-03-03 14:45:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:45:09,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:09,985 INFO L225 Difference]: With dead ends: 844 [2025-03-03 14:45:09,985 INFO L226 Difference]: Without dead ends: 445 [2025-03-03 14:45:09,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:09,989 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 401 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:09,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 608 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:45:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-03 14:45:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 412. [2025-03-03 14:45:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 367 states have (on average 1.4822888283378746) internal successors, (544), 369 states have internal predecessors, (544), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-03-03 14:45:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 607 transitions. [2025-03-03 14:45:10,038 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 607 transitions. Word has length 103 [2025-03-03 14:45:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:10,038 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 607 transitions. [2025-03-03 14:45:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 607 transitions. [2025-03-03 14:45:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:10,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:10,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:10,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:45:10,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:10,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:10,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1623187940, now seen corresponding path program 1 times [2025-03-03 14:45:10,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579656437] [2025-03-03 14:45:10,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:10,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:10,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:10,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:10,191 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 14:45:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579656437] [2025-03-03 14:45:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579656437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:10,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725152558] [2025-03-03 14:45:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:10,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:10,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:10,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:10,195 INFO L87 Difference]: Start difference. First operand 412 states and 607 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:10,741 INFO L93 Difference]: Finished difference Result 1096 states and 1629 transitions. [2025-03-03 14:45:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:10,746 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:45:10,746 INFO L226 Difference]: Without dead ends: 697 [2025-03-03 14:45:10,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:45:10,749 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 590 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1606 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:45:10,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-03 14:45:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 600. [2025-03-03 14:45:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 535 states have (on average 1.4728971962616821) internal successors, (788), 538 states have internal predecessors, (788), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-03 14:45:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 880 transitions. [2025-03-03 14:45:10,793 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 880 transitions. Word has length 103 [2025-03-03 14:45:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:10,794 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 880 transitions. [2025-03-03 14:45:10,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 880 transitions. [2025-03-03 14:45:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:10,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:10,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:10,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:45:10,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1503583101, now seen corresponding path program 1 times [2025-03-03 14:45:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744309882] [2025-03-03 14:45:10,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:10,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:10,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:10,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:10,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:10,916 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 14:45:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744309882] [2025-03-03 14:45:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744309882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146498148] [2025-03-03 14:45:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:10,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:10,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:10,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:10,918 INFO L87 Difference]: Start difference. First operand 600 states and 880 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:11,515 INFO L93 Difference]: Finished difference Result 1682 states and 2491 transitions. [2025-03-03 14:45:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:11,522 INFO L225 Difference]: With dead ends: 1682 [2025-03-03 14:45:11,523 INFO L226 Difference]: Without dead ends: 1095 [2025-03-03 14:45:11,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:45:11,525 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 585 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:11,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1590 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:45:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-03-03 14:45:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 993. [2025-03-03 14:45:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 886 states have (on average 1.4706546275395034) internal successors, (1303), 893 states have internal predecessors, (1303), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-03-03 14:45:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1459 transitions. [2025-03-03 14:45:11,584 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1459 transitions. Word has length 103 [2025-03-03 14:45:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1459 transitions. [2025-03-03 14:45:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1459 transitions. [2025-03-03 14:45:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:11,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:11,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:11,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:45:11,587 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1582141956, now seen corresponding path program 1 times [2025-03-03 14:45:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965277146] [2025-03-03 14:45:11,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:11,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:11,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:11,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:11,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:11,709 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 14:45:11,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:11,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965277146] [2025-03-03 14:45:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965277146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:11,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616052008] [2025-03-03 14:45:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:11,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:11,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:11,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:11,710 INFO L87 Difference]: Start difference. First operand 993 states and 1459 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:12,290 INFO L93 Difference]: Finished difference Result 2917 states and 4344 transitions. [2025-03-03 14:45:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:12,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:12,301 INFO L225 Difference]: With dead ends: 2917 [2025-03-03 14:45:12,301 INFO L226 Difference]: Without dead ends: 1937 [2025-03-03 14:45:12,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:45:12,305 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 580 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:12,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1578 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:45:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2025-03-03 14:45:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1824. [2025-03-03 14:45:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1627 states have (on average 1.4769514443761524) internal successors, (2403), 1648 states have internal predecessors, (2403), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-03-03 14:45:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2711 transitions. [2025-03-03 14:45:12,439 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2711 transitions. Word has length 103 [2025-03-03 14:45:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2711 transitions. [2025-03-03 14:45:12,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2711 transitions. [2025-03-03 14:45:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:12,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:12,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:45:12,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:12,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1504907165, now seen corresponding path program 1 times [2025-03-03 14:45:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748665445] [2025-03-03 14:45:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:12,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:12,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:12,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:12,547 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 14:45:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748665445] [2025-03-03 14:45:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748665445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:12,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:12,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102580572] [2025-03-03 14:45:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:12,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:12,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:12,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:12,549 INFO L87 Difference]: Start difference. First operand 1824 states and 2711 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:13,142 INFO L93 Difference]: Finished difference Result 5548 states and 8414 transitions. [2025-03-03 14:45:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:13,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:13,159 INFO L225 Difference]: With dead ends: 5548 [2025-03-03 14:45:13,159 INFO L226 Difference]: Without dead ends: 3737 [2025-03-03 14:45:13,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:45:13,164 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 575 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:13,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1566 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2025-03-03 14:45:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3603. [2025-03-03 14:45:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3208 states have (on average 1.489713216957606) internal successors, (4779), 3275 states have internal predecessors, (4779), 226 states have call successors, (226), 102 states have call predecessors, (226), 168 states have return successors, (482), 241 states have call predecessors, (482), 226 states have call successors, (482) [2025-03-03 14:45:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 5487 transitions. [2025-03-03 14:45:13,310 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 5487 transitions. Word has length 103 [2025-03-03 14:45:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:13,311 INFO L471 AbstractCegarLoop]: Abstraction has 3603 states and 5487 transitions. [2025-03-03 14:45:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 5487 transitions. [2025-03-03 14:45:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:13,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:13,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:13,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:45:13,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:13,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1305004580, now seen corresponding path program 1 times [2025-03-03 14:45:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806259671] [2025-03-03 14:45:13,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:13,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:13,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:13,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:13,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:13,400 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 14:45:13,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806259671] [2025-03-03 14:45:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806259671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692839546] [2025-03-03 14:45:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:13,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:13,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:13,401 INFO L87 Difference]: Start difference. First operand 3603 states and 5487 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:13,716 INFO L93 Difference]: Finished difference Result 7691 states and 11993 transitions. [2025-03-03 14:45:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:45:13,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:13,734 INFO L225 Difference]: With dead ends: 7691 [2025-03-03 14:45:13,735 INFO L226 Difference]: Without dead ends: 4101 [2025-03-03 14:45:13,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:13,744 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 392 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:13,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 574 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:45:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2025-03-03 14:45:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 3603. [2025-03-03 14:45:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3603 states, 3208 states have (on average 1.4844139650872819) internal successors, (4762), 3275 states have internal predecessors, (4762), 226 states have call successors, (226), 102 states have call predecessors, (226), 168 states have return successors, (482), 241 states have call predecessors, (482), 226 states have call successors, (482) [2025-03-03 14:45:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 3603 states and 5470 transitions. [2025-03-03 14:45:13,923 INFO L78 Accepts]: Start accepts. Automaton has 3603 states and 5470 transitions. Word has length 103 [2025-03-03 14:45:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:13,924 INFO L471 AbstractCegarLoop]: Abstraction has 3603 states and 5470 transitions. [2025-03-03 14:45:13,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3603 states and 5470 transitions. [2025-03-03 14:45:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:13,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:13,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:13,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:45:13,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2088383555, now seen corresponding path program 1 times [2025-03-03 14:45:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773017825] [2025-03-03 14:45:13,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:13,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:13,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:13,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:13,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:14,019 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 14:45:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:14,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773017825] [2025-03-03 14:45:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773017825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:14,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616576058] [2025-03-03 14:45:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:14,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:14,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:14,022 INFO L87 Difference]: Start difference. First operand 3603 states and 5470 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:14,694 INFO L93 Difference]: Finished difference Result 11535 states and 17998 transitions. [2025-03-03 14:45:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:14,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:14,730 INFO L225 Difference]: With dead ends: 11535 [2025-03-03 14:45:14,730 INFO L226 Difference]: Without dead ends: 7945 [2025-03-03 14:45:14,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:45:14,742 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 666 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:14,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1517 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7945 states. [2025-03-03 14:45:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7945 to 7329. [2025-03-03 14:45:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 6500 states have (on average 1.4966153846153847) internal successors, (9728), 6713 states have internal predecessors, (9728), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-03-03 14:45:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 11588 transitions. [2025-03-03 14:45:15,127 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 11588 transitions. Word has length 103 [2025-03-03 14:45:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:15,128 INFO L471 AbstractCegarLoop]: Abstraction has 7329 states and 11588 transitions. [2025-03-03 14:45:15,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 11588 transitions. [2025-03-03 14:45:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:15,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:15,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:15,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:45:15,136 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:15,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1559464516, now seen corresponding path program 1 times [2025-03-03 14:45:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489675063] [2025-03-03 14:45:15,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:15,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:15,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:15,200 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 14:45:15,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489675063] [2025-03-03 14:45:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489675063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569145319] [2025-03-03 14:45:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:15,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:15,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:15,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:15,203 INFO L87 Difference]: Start difference. First operand 7329 states and 11588 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:15,627 INFO L93 Difference]: Finished difference Result 15625 states and 25473 transitions. [2025-03-03 14:45:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:45:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:15,675 INFO L225 Difference]: With dead ends: 15625 [2025-03-03 14:45:15,675 INFO L226 Difference]: Without dead ends: 8309 [2025-03-03 14:45:15,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:15,729 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 388 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:15,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 560 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:45:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states. [2025-03-03 14:45:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 7329. [2025-03-03 14:45:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 6500 states have (on average 1.4915384615384615) internal successors, (9695), 6713 states have internal predecessors, (9695), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-03-03 14:45:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 11555 transitions. [2025-03-03 14:45:16,090 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 11555 transitions. Word has length 103 [2025-03-03 14:45:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 7329 states and 11555 transitions. [2025-03-03 14:45:16,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 11555 transitions. [2025-03-03 14:45:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:16,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:16,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:16,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:45:16,100 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash 988213283, now seen corresponding path program 1 times [2025-03-03 14:45:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:16,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391136568] [2025-03-03 14:45:16,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:16,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:16,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:16,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:16,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:16,169 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 14:45:16,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:16,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391136568] [2025-03-03 14:45:16,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391136568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:16,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:16,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:16,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615771483] [2025-03-03 14:45:16,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:16,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:16,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:16,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:16,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:16,172 INFO L87 Difference]: Start difference. First operand 7329 states and 11555 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:16,756 INFO L93 Difference]: Finished difference Result 15380 states and 24917 transitions. [2025-03-03 14:45:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:45:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:16,790 INFO L225 Difference]: With dead ends: 15380 [2025-03-03 14:45:16,790 INFO L226 Difference]: Without dead ends: 8064 [2025-03-03 14:45:16,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:16,809 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 385 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:16,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 552 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:45:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2025-03-03 14:45:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7329. [2025-03-03 14:45:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 6500 states have (on average 1.4864615384615385) internal successors, (9662), 6713 states have internal predecessors, (9662), 418 states have call successors, (418), 198 states have call predecessors, (418), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-03-03 14:45:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 11522 transitions. [2025-03-03 14:45:17,325 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 11522 transitions. Word has length 103 [2025-03-03 14:45:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:17,326 INFO L471 AbstractCegarLoop]: Abstraction has 7329 states and 11522 transitions. [2025-03-03 14:45:17,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 11522 transitions. [2025-03-03 14:45:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:17,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:17,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:17,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:45:17,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:17,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1108333156, now seen corresponding path program 1 times [2025-03-03 14:45:17,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:17,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124284418] [2025-03-03 14:45:17,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:17,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:17,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:17,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:17,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:17,412 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 14:45:17,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:17,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124284418] [2025-03-03 14:45:17,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124284418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:17,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:17,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:45:17,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254981161] [2025-03-03 14:45:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:17,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:45:17,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:17,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:45:17,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:45:17,413 INFO L87 Difference]: Start difference. First operand 7329 states and 11522 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:18,322 INFO L93 Difference]: Finished difference Result 22513 states and 36948 transitions. [2025-03-03 14:45:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:45:18,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:18,383 INFO L225 Difference]: With dead ends: 22513 [2025-03-03 14:45:18,384 INFO L226 Difference]: Without dead ends: 15197 [2025-03-03 14:45:18,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:45:18,405 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 555 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:18,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1467 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15197 states. [2025-03-03 14:45:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15197 to 14814. [2025-03-03 14:45:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14814 states, 12971 states have (on average 1.4769871251252795) internal successors, (19158), 13638 states have internal predecessors, (19158), 786 states have call successors, (786), 390 states have call predecessors, (786), 1056 states have return successors, (4882), 849 states have call predecessors, (4882), 786 states have call successors, (4882) [2025-03-03 14:45:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14814 states to 14814 states and 24826 transitions. [2025-03-03 14:45:19,295 INFO L78 Accepts]: Start accepts. Automaton has 14814 states and 24826 transitions. Word has length 103 [2025-03-03 14:45:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:19,296 INFO L471 AbstractCegarLoop]: Abstraction has 14814 states and 24826 transitions. [2025-03-03 14:45:19,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 14814 states and 24826 transitions. [2025-03-03 14:45:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:19,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:19,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:19,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:45:19,312 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:19,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:19,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1527849987, now seen corresponding path program 1 times [2025-03-03 14:45:19,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:19,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451668223] [2025-03-03 14:45:19,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:19,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:19,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:19,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:19,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:19,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:19,378 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 14:45:19,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:19,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451668223] [2025-03-03 14:45:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451668223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:19,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818146664] [2025-03-03 14:45:19,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:19,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:19,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:19,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:19,381 INFO L87 Difference]: Start difference. First operand 14814 states and 24826 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:20,133 INFO L93 Difference]: Finished difference Result 29617 states and 50027 transitions. [2025-03-03 14:45:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:20,193 INFO L225 Difference]: With dead ends: 29617 [2025-03-03 14:45:20,193 INFO L226 Difference]: Without dead ends: 14817 [2025-03-03 14:45:20,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:20,227 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:20,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1210 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14817 states. [2025-03-03 14:45:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14817 to 14817. [2025-03-03 14:45:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14817 states, 12974 states have (on average 1.471943887775551) internal successors, (19097), 13641 states have internal predecessors, (19097), 786 states have call successors, (786), 390 states have call predecessors, (786), 1056 states have return successors, (4882), 849 states have call predecessors, (4882), 786 states have call successors, (4882) [2025-03-03 14:45:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14817 states to 14817 states and 24765 transitions. [2025-03-03 14:45:20,956 INFO L78 Accepts]: Start accepts. Automaton has 14817 states and 24765 transitions. Word has length 103 [2025-03-03 14:45:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:20,956 INFO L471 AbstractCegarLoop]: Abstraction has 14817 states and 24765 transitions. [2025-03-03 14:45:20,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14817 states and 24765 transitions. [2025-03-03 14:45:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:20,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:20,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:45:20,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:20,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1281536900, now seen corresponding path program 1 times [2025-03-03 14:45:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:20,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869788081] [2025-03-03 14:45:20,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:20,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:20,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:20,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:20,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:21,002 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 14:45:21,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:21,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869788081] [2025-03-03 14:45:21,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869788081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:21,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:21,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:21,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555142509] [2025-03-03 14:45:21,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:21,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:21,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:21,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:21,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:21,003 INFO L87 Difference]: Start difference. First operand 14817 states and 24765 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:22,064 INFO L93 Difference]: Finished difference Result 44193 states and 74219 transitions. [2025-03-03 14:45:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:45:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:22,170 INFO L225 Difference]: With dead ends: 44193 [2025-03-03 14:45:22,170 INFO L226 Difference]: Without dead ends: 29390 [2025-03-03 14:45:22,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:22,201 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 535 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:22,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1077 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:45:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29390 states. [2025-03-03 14:45:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29390 to 29192. [2025-03-03 14:45:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29192 states, 25544 states have (on average 1.469033823989978) internal successors, (37525), 26877 states have internal predecessors, (37525), 1535 states have call successors, (1535), 780 states have call predecessors, (1535), 2112 states have return successors, (9664), 1598 states have call predecessors, (9664), 1535 states have call successors, (9664) [2025-03-03 14:45:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29192 states to 29192 states and 48724 transitions. [2025-03-03 14:45:24,060 INFO L78 Accepts]: Start accepts. Automaton has 29192 states and 48724 transitions. Word has length 103 [2025-03-03 14:45:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:24,062 INFO L471 AbstractCegarLoop]: Abstraction has 29192 states and 48724 transitions. [2025-03-03 14:45:24,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 29192 states and 48724 transitions. [2025-03-03 14:45:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:24,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:24,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:24,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:45:24,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1405427463, now seen corresponding path program 1 times [2025-03-03 14:45:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036857261] [2025-03-03 14:45:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:24,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:24,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:24,138 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 14:45:24,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:24,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036857261] [2025-03-03 14:45:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036857261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:24,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:24,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630215473] [2025-03-03 14:45:24,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:24,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:24,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:24,140 INFO L87 Difference]: Start difference. First operand 29192 states and 48724 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:25,549 INFO L93 Difference]: Finished difference Result 58565 states and 98438 transitions. [2025-03-03 14:45:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:25,670 INFO L225 Difference]: With dead ends: 58565 [2025-03-03 14:45:25,670 INFO L226 Difference]: Without dead ends: 29387 [2025-03-03 14:45:25,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:25,731 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 0 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:25,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1210 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29387 states. [2025-03-03 14:45:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29387 to 29387. [2025-03-03 14:45:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29387 states, 25739 states have (on average 1.462955048758693) internal successors, (37655), 27072 states have internal predecessors, (37655), 1535 states have call successors, (1535), 780 states have call predecessors, (1535), 2112 states have return successors, (9664), 1598 states have call predecessors, (9664), 1535 states have call successors, (9664) [2025-03-03 14:45:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29387 states to 29387 states and 48854 transitions. [2025-03-03 14:45:27,078 INFO L78 Accepts]: Start accepts. Automaton has 29387 states and 48854 transitions. Word has length 103 [2025-03-03 14:45:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:27,078 INFO L471 AbstractCegarLoop]: Abstraction has 29387 states and 48854 transitions. [2025-03-03 14:45:27,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 29387 states and 48854 transitions. [2025-03-03 14:45:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:27,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:27,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:27,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:45:27,090 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:27,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1196729160, now seen corresponding path program 1 times [2025-03-03 14:45:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:27,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343191283] [2025-03-03 14:45:27,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:27,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:27,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:27,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:27,140 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 14:45:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343191283] [2025-03-03 14:45:27,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343191283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:27,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325539898] [2025-03-03 14:45:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:27,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:27,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:27,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:27,142 INFO L87 Difference]: Start difference. First operand 29387 states and 48854 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:33,016 INFO L93 Difference]: Finished difference Result 171940 states and 291742 transitions. [2025-03-03 14:45:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:45:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-03 14:45:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:33,603 INFO L225 Difference]: With dead ends: 171940 [2025-03-03 14:45:33,603 INFO L226 Difference]: Without dead ends: 142567 [2025-03-03 14:45:33,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:45:33,787 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1447 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:33,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 1295 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:45:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142567 states. [2025-03-03 14:45:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142567 to 139955. [2025-03-03 14:45:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139955 states, 122385 states have (on average 1.4727540139723005) internal successors, (180243), 129176 states have internal predecessors, (180243), 7009 states have call successors, (7009), 3900 states have call predecessors, (7009), 10560 states have return successors, (49756), 6942 states have call predecessors, (49756), 7009 states have call successors, (49756) [2025-03-03 14:45:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139955 states to 139955 states and 237008 transitions. [2025-03-03 14:45:42,028 INFO L78 Accepts]: Start accepts. Automaton has 139955 states and 237008 transitions. Word has length 103 [2025-03-03 14:45:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:42,028 INFO L471 AbstractCegarLoop]: Abstraction has 139955 states and 237008 transitions. [2025-03-03 14:45:42,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:45:42,028 INFO L276 IsEmpty]: Start isEmpty. Operand 139955 states and 237008 transitions. [2025-03-03 14:45:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:45:42,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:42,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:45:42,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:45:42,041 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:42,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -171791093, now seen corresponding path program 1 times [2025-03-03 14:45:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:42,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314306759] [2025-03-03 14:45:42,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:42,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:45:42,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:45:42,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:42,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:42,092 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 14:45:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314306759] [2025-03-03 14:45:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314306759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:45:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542891484] [2025-03-03 14:45:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:42,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:45:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:42,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:45:42,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:42,093 INFO L87 Difference]: Start difference. First operand 139955 states and 237008 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)