./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.07.cil-2.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/token_ring.07.cil-2.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 32b030e5f1b46150870f8dd8e24821389f0ffe4175e43053767dc9109bffcf9b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:44:04,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:44:04,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:44:04,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:44:04,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:44:04,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:44:04,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:44:04,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:44:04,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:44:04,608 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:44:04,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:44:04,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:44:04,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:44:04,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:44:04,610 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:44:04,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:44:04,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:44:04,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:44:04,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:44:04,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:44:04,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:44:04,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:44:04,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:04,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:44:04,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:44:04,613 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 -> 32b030e5f1b46150870f8dd8e24821389f0ffe4175e43053767dc9109bffcf9b [2025-03-03 14:44:04,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:44:04,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:44:04,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:44:04,865 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:44:04,865 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:44:04,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.07.cil-2.c [2025-03-03 14:44:06,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69d06772/773fdcd2ec4a48e3b25072e5d47ade0b/FLAG9c86c4cf4 [2025-03-03 14:44:06,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:44:06,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c [2025-03-03 14:44:06,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69d06772/773fdcd2ec4a48e3b25072e5d47ade0b/FLAG9c86c4cf4 [2025-03-03 14:44:06,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f69d06772/773fdcd2ec4a48e3b25072e5d47ade0b [2025-03-03 14:44:06,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:44:06,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:44:06,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:06,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:44:06,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:44:06,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238aa771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06, skipping insertion in model container [2025-03-03 14:44:06,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:44:06,552 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/token_ring.07.cil-2.c[671,684] [2025-03-03 14:44:06,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:06,634 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:44:06,640 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/token_ring.07.cil-2.c[671,684] [2025-03-03 14:44:06,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:06,685 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:44:06,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06 WrapperNode [2025-03-03 14:44:06,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:06,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:06,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:44:06,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:44:06,693 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:44:06" (1/1) ... [2025-03-03 14:44:06,701 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:44:06" (1/1) ... [2025-03-03 14:44:06,730 INFO L138 Inliner]: procedures = 42, calls = 53, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 555 [2025-03-03 14:44:06,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:06,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:44:06,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:44:06,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:44:06,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,754 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:44:06,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:44:06,772 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:44:06,772 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:44:06,772 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:44:06,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (1/1) ... [2025-03-03 14:44:06,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:06,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:44:06,798 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:44:06,806 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:44:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:44:06,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:44:06,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:44:06,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:44:06,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:44:07,471 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-03 14:44:07,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:44:07,489 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:44:07,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:44:07,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:07 BoogieIcfgContainer [2025-03-03 14:44:07,491 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:44:07,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:44:07,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:44:07,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:44:07,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:44:06" (1/3) ... [2025-03-03 14:44:07,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ff563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:07, skipping insertion in model container [2025-03-03 14:44:07,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:06" (2/3) ... [2025-03-03 14:44:07,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ff563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:07, skipping insertion in model container [2025-03-03 14:44:07,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:07" (3/3) ... [2025-03-03 14:44:07,500 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.07.cil-2.c [2025-03-03 14:44:07,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:44:07,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.07.cil-2.c that has 8 procedures, 281 locations, 1 initial locations, 10 loop locations, and 1 error locations. [2025-03-03 14:44:07,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:44:07,597 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;@6143357f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:44:07,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:44:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 281 states, 249 states have (on average 1.5662650602409638) internal successors, (390), 253 states have internal predecessors, (390), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 14:44:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:07,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:07,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:07,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:07,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash -316656410, now seen corresponding path program 1 times [2025-03-03 14:44:07,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:07,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886832814] [2025-03-03 14:44:07,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:07,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:07,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:07,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:08,118 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:44:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886832814] [2025-03-03 14:44:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886832814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:08,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:08,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:08,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46631289] [2025-03-03 14:44:08,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:08,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:08,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:08,141 INFO L87 Difference]: Start difference. First operand has 281 states, 249 states have (on average 1.5662650602409638) internal successors, (390), 253 states have internal predecessors, (390), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:08,679 INFO L93 Difference]: Finished difference Result 837 states and 1314 transitions. [2025-03-03 14:44:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:44:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:08,689 INFO L225 Difference]: With dead ends: 837 [2025-03-03 14:44:08,690 INFO L226 Difference]: Without dead ends: 563 [2025-03-03 14:44:08,693 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:44:08,695 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 761 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:08,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1194 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-03 14:44:08,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 542. [2025-03-03 14:44:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 492 states have internal predecessors, (751), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2025-03-03 14:44:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 828 transitions. [2025-03-03 14:44:08,749 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 828 transitions. Word has length 123 [2025-03-03 14:44:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:08,749 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 828 transitions. [2025-03-03 14:44:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 828 transitions. [2025-03-03 14:44:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:08,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:08,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:08,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:44:08,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -825480604, now seen corresponding path program 1 times [2025-03-03 14:44:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536077501] [2025-03-03 14:44:08,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:08,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:08,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:08,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:08,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:08,979 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:44:08,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:08,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536077501] [2025-03-03 14:44:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536077501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:08,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:08,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764242778] [2025-03-03 14:44:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:08,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:08,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:08,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:08,983 INFO L87 Difference]: Start difference. First operand 542 states and 828 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:09,543 INFO L93 Difference]: Finished difference Result 1404 states and 2167 transitions. [2025-03-03 14:44:09,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:09,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:09,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:09,551 INFO L225 Difference]: With dead ends: 1404 [2025-03-03 14:44:09,551 INFO L226 Difference]: Without dead ends: 877 [2025-03-03 14:44:09,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:09,557 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 756 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:09,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2258 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-03 14:44:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 792. [2025-03-03 14:44:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 716 states have (on average 1.5279329608938548) internal successors, (1094), 720 states have internal predecessors, (1094), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (57), 54 states have call predecessors, (57), 53 states have call successors, (57) [2025-03-03 14:44:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1206 transitions. [2025-03-03 14:44:09,641 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1206 transitions. Word has length 123 [2025-03-03 14:44:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:09,641 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1206 transitions. [2025-03-03 14:44:09,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1206 transitions. [2025-03-03 14:44:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:09,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:09,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:09,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:44:09,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:09,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash -766259867, now seen corresponding path program 1 times [2025-03-03 14:44:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:09,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238349872] [2025-03-03 14:44:09,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:09,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:09,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:09,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:09,823 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:44:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238349872] [2025-03-03 14:44:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238349872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:09,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:09,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038813888] [2025-03-03 14:44:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:09,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:09,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:09,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:09,826 INFO L87 Difference]: Start difference. First operand 792 states and 1206 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:10,374 INFO L93 Difference]: Finished difference Result 2194 states and 3380 transitions. [2025-03-03 14:44:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:10,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:10,381 INFO L225 Difference]: With dead ends: 2194 [2025-03-03 14:44:10,381 INFO L226 Difference]: Without dead ends: 1417 [2025-03-03 14:44:10,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:10,384 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 751 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:10,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 2242 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2025-03-03 14:44:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1321. [2025-03-03 14:44:10,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1197 states have (on average 1.5296574770258982) internal successors, (1831), 1205 states have internal predecessors, (1831), 87 states have call successors, (87), 31 states have call predecessors, (87), 36 states have return successors, (101), 88 states have call predecessors, (101), 85 states have call successors, (101) [2025-03-03 14:44:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2019 transitions. [2025-03-03 14:44:10,446 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2019 transitions. Word has length 123 [2025-03-03 14:44:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:10,447 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 2019 transitions. [2025-03-03 14:44:10,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2019 transitions. [2025-03-03 14:44:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:10,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:10,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:10,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:44:10,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:10,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash -71612860, now seen corresponding path program 1 times [2025-03-03 14:44:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:10,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935789504] [2025-03-03 14:44:10,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:10,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:10,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:10,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:10,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:10,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:10,625 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:44:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:10,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935789504] [2025-03-03 14:44:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935789504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:10,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:10,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520763084] [2025-03-03 14:44:10,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:10,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:10,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:10,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:10,627 INFO L87 Difference]: Start difference. First operand 1321 states and 2019 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:11,222 INFO L93 Difference]: Finished difference Result 3885 states and 6031 transitions. [2025-03-03 14:44:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:11,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:11,237 INFO L225 Difference]: With dead ends: 3885 [2025-03-03 14:44:11,237 INFO L226 Difference]: Without dead ends: 2579 [2025-03-03 14:44:11,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:11,242 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 746 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:11,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 2230 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2025-03-03 14:44:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2460. [2025-03-03 14:44:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 2234 states have (on average 1.5429722470904208) internal successors, (3447), 2256 states have internal predecessors, (3447), 151 states have call successors, (151), 55 states have call predecessors, (151), 74 states have return successors, (213), 156 states have call predecessors, (213), 149 states have call successors, (213) [2025-03-03 14:44:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3811 transitions. [2025-03-03 14:44:11,338 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3811 transitions. Word has length 123 [2025-03-03 14:44:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:11,339 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3811 transitions. [2025-03-03 14:44:11,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3811 transitions. [2025-03-03 14:44:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:11,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:11,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:11,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:44:11,341 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:11,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1059173765, now seen corresponding path program 1 times [2025-03-03 14:44:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290547514] [2025-03-03 14:44:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:11,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:11,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:11,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:11,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:11,473 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:44:11,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:11,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290547514] [2025-03-03 14:44:11,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290547514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:11,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:11,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330009998] [2025-03-03 14:44:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:11,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:11,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:11,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:11,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:11,475 INFO L87 Difference]: Start difference. First operand 2460 states and 3811 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:12,074 INFO L93 Difference]: Finished difference Result 7572 states and 11985 transitions. [2025-03-03 14:44:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:12,096 INFO L225 Difference]: With dead ends: 7572 [2025-03-03 14:44:12,097 INFO L226 Difference]: Without dead ends: 5127 [2025-03-03 14:44:12,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:12,104 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 741 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:12,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 2218 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2025-03-03 14:44:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4963. [2025-03-03 14:44:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4963 states, 4515 states have (on average 1.5661129568106311) internal successors, (7071), 4583 states have internal predecessors, (7071), 279 states have call successors, (279), 103 states have call predecessors, (279), 168 states have return successors, (533), 292 states have call predecessors, (533), 277 states have call successors, (533) [2025-03-03 14:44:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 7883 transitions. [2025-03-03 14:44:12,282 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 7883 transitions. Word has length 123 [2025-03-03 14:44:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:12,282 INFO L471 AbstractCegarLoop]: Abstraction has 4963 states and 7883 transitions. [2025-03-03 14:44:12,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 7883 transitions. [2025-03-03 14:44:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:12,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:12,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:12,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:44:12,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:12,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:12,287 INFO L85 PathProgramCache]: Analyzing trace with hash 125819428, now seen corresponding path program 1 times [2025-03-03 14:44:12,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:12,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899546212] [2025-03-03 14:44:12,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:12,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:12,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:12,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:12,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:12,416 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:44:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899546212] [2025-03-03 14:44:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899546212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946419215] [2025-03-03 14:44:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:12,418 INFO L87 Difference]: Start difference. First operand 4963 states and 7883 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:13,117 INFO L93 Difference]: Finished difference Result 15787 states and 25827 transitions. [2025-03-03 14:44:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:13,169 INFO L225 Difference]: With dead ends: 15787 [2025-03-03 14:44:13,170 INFO L226 Difference]: Without dead ends: 10839 [2025-03-03 14:44:13,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:13,186 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 736 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:13,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2206 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10839 states. [2025-03-03 14:44:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10839 to 10590. [2025-03-03 14:44:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10590 states, 9644 states have (on average 1.5959145582745748) internal successors, (15391), 9858 states have internal predecessors, (15391), 535 states have call successors, (535), 199 states have call predecessors, (535), 410 states have return successors, (1557), 564 states have call predecessors, (1557), 533 states have call successors, (1557) [2025-03-03 14:44:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 17483 transitions. [2025-03-03 14:44:13,594 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 17483 transitions. Word has length 123 [2025-03-03 14:44:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:13,594 INFO L471 AbstractCegarLoop]: Abstraction has 10590 states and 17483 transitions. [2025-03-03 14:44:13,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 17483 transitions. [2025-03-03 14:44:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:13,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:13,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:13,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:44:13,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:13,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1619731877, now seen corresponding path program 1 times [2025-03-03 14:44:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604702874] [2025-03-03 14:44:13,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:13,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:13,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:13,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:13,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:13,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:13,691 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:44:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604702874] [2025-03-03 14:44:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604702874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946464322] [2025-03-03 14:44:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:13,693 INFO L87 Difference]: Start difference. First operand 10590 states and 17483 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:14,609 INFO L93 Difference]: Finished difference Result 34526 states and 59377 transitions. [2025-03-03 14:44:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:14,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:14,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:14,709 INFO L225 Difference]: With dead ends: 34526 [2025-03-03 14:44:14,709 INFO L226 Difference]: Without dead ends: 23951 [2025-03-03 14:44:14,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:14,746 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 731 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:14,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 2194 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2025-03-03 14:44:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 23545. [2025-03-03 14:44:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23545 states, 21441 states have (on average 1.629168415652255) internal successors, (34931), 22109 states have internal predecessors, (34931), 1047 states have call successors, (1047), 391 states have call predecessors, (1047), 1056 states have return successors, (5141), 1108 states have call predecessors, (5141), 1045 states have call successors, (5141) [2025-03-03 14:44:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23545 states to 23545 states and 41119 transitions. [2025-03-03 14:44:15,769 INFO L78 Accepts]: Start accepts. Automaton has 23545 states and 41119 transitions. Word has length 123 [2025-03-03 14:44:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:15,770 INFO L471 AbstractCegarLoop]: Abstraction has 23545 states and 41119 transitions. [2025-03-03 14:44:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 23545 states and 41119 transitions. [2025-03-03 14:44:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:15,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:15,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:15,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:44:15,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:15,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash 420996612, now seen corresponding path program 1 times [2025-03-03 14:44:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:15,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559885620] [2025-03-03 14:44:15,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:15,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:15,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:15,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:15,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:15,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:15,880 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:44:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:15,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559885620] [2025-03-03 14:44:15,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559885620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:15,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:15,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902990478] [2025-03-03 14:44:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:15,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:15,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:15,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:15,882 INFO L87 Difference]: Start difference. First operand 23545 states and 41119 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:17,507 INFO L93 Difference]: Finished difference Result 78293 states and 144743 transitions. [2025-03-03 14:44:17,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:17,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:17,787 INFO L225 Difference]: With dead ends: 78293 [2025-03-03 14:44:17,788 INFO L226 Difference]: Without dead ends: 54763 [2025-03-03 14:44:17,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:44:17,888 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 726 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:17,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 2182 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54763 states. [2025-03-03 14:44:19,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54763 to 54072. [2025-03-03 14:44:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54072 states, 49166 states have (on average 1.662836106252288) internal successors, (81755), 51228 states have internal predecessors, (81755), 2071 states have call successors, (2071), 775 states have call predecessors, (2071), 2834 states have return successors, (18453), 2196 states have call predecessors, (18453), 2069 states have call successors, (18453) [2025-03-03 14:44:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54072 states to 54072 states and 102279 transitions. [2025-03-03 14:44:20,142 INFO L78 Accepts]: Start accepts. Automaton has 54072 states and 102279 transitions. Word has length 123 [2025-03-03 14:44:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:20,142 INFO L471 AbstractCegarLoop]: Abstraction has 54072 states and 102279 transitions. [2025-03-03 14:44:20,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 54072 states and 102279 transitions. [2025-03-03 14:44:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:20,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:20,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:20,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:44:20,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 936517061, now seen corresponding path program 1 times [2025-03-03 14:44:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580963355] [2025-03-03 14:44:20,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:20,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:20,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:20,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:20,399 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:44:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:20,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580963355] [2025-03-03 14:44:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580963355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:20,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202020497] [2025-03-03 14:44:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:20,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:20,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:20,401 INFO L87 Difference]: Start difference. First operand 54072 states and 102279 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:24,259 INFO L93 Difference]: Finished difference Result 189688 states and 384662 transitions. [2025-03-03 14:44:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:24,929 INFO L225 Difference]: With dead ends: 189688 [2025-03-03 14:44:24,929 INFO L226 Difference]: Without dead ends: 135631 [2025-03-03 14:44:25,119 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:44:25,121 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 945 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:25,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2157 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135631 states. [2025-03-03 14:44:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135631 to 127135. [2025-03-03 14:44:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127135 states, 115295 states have (on average 1.6956069213756018) internal successors, (195495), 121603 states have internal predecessors, (195495), 3991 states have call successors, (3991), 1543 states have call predecessors, (3991), 7848 states have return successors, (69525), 4244 states have call predecessors, (69525), 3989 states have call successors, (69525) [2025-03-03 14:44:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127135 states to 127135 states and 269011 transitions. [2025-03-03 14:44:30,836 INFO L78 Accepts]: Start accepts. Automaton has 127135 states and 269011 transitions. Word has length 123 [2025-03-03 14:44:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:30,836 INFO L471 AbstractCegarLoop]: Abstraction has 127135 states and 269011 transitions. [2025-03-03 14:44:30,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 127135 states and 269011 transitions. [2025-03-03 14:44:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:30,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:30,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:30,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:44:30,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:30,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash -16684572, now seen corresponding path program 1 times [2025-03-03 14:44:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:30,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440008611] [2025-03-03 14:44:30,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:30,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:30,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:30,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:30,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:30,979 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:44:30,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440008611] [2025-03-03 14:44:30,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440008611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:30,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:30,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:30,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314905542] [2025-03-03 14:44:30,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:30,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:30,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:30,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:30,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:30,983 INFO L87 Difference]: Start difference. First operand 127135 states and 269011 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:37,511 INFO L93 Difference]: Finished difference Result 306759 states and 689368 transitions. [2025-03-03 14:44:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-03-03 14:44:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:38,413 INFO L225 Difference]: With dead ends: 306759 [2025-03-03 14:44:38,413 INFO L226 Difference]: Without dead ends: 179639 [2025-03-03 14:44:38,958 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:44:38,958 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 538 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:38,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 795 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:44:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179639 states. [2025-03-03 14:44:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179639 to 127135. [2025-03-03 14:44:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127135 states, 115295 states have (on average 1.6933778568021163) internal successors, (195238), 121603 states have internal predecessors, (195238), 3991 states have call successors, (3991), 1543 states have call predecessors, (3991), 7848 states have return successors, (69525), 4244 states have call predecessors, (69525), 3989 states have call successors, (69525) [2025-03-03 14:44:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127135 states to 127135 states and 268754 transitions. [2025-03-03 14:44:53,145 INFO L78 Accepts]: Start accepts. Automaton has 127135 states and 268754 transitions. Word has length 123 [2025-03-03 14:44:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,146 INFO L471 AbstractCegarLoop]: Abstraction has 127135 states and 268754 transitions. [2025-03-03 14:44:53,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 127135 states and 268754 transitions. [2025-03-03 14:44:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:44:53,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:53,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:44:53,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 783850981, now seen corresponding path program 1 times [2025-03-03 14:44:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449374023] [2025-03-03 14:44:53,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:44:53,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:44:53,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,345 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:44:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449374023] [2025-03-03 14:44:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449374023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118639200] [2025-03-03 14:44:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:53,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:53,347 INFO L87 Difference]: Start difference. First operand 127135 states and 268754 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)