./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.07.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-05 16:08:01,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:08:01,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:08:01,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:08:01,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:08:01,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:08:01,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:08:01,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:08:01,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:08:01,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:08:01,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:08:01,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:08:01,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:08:01,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:08:01,884 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:08:01,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:08:01,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:08:01,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:08:01,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:08:01,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:08:01,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:08:01,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:08:01,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:08:01,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:08:01,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:08:01,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:08:01,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:08:01,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:08:01,887 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-jdk21/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-02-05 16:08:02,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:08:02,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:08:02,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:08:02,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:08:02,131 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:08:02,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.07.cil-2.c [2025-02-05 16:08:03,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce0a8219f/ce5d3127f0104a269f4e092f6f69d4c7/FLAG9d4ff34d1 [2025-02-05 16:08:03,523 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:08:03,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c [2025-02-05 16:08:03,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce0a8219f/ce5d3127f0104a269f4e092f6f69d4c7/FLAG9d4ff34d1 [2025-02-05 16:08:03,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce0a8219f/ce5d3127f0104a269f4e092f6f69d4c7 [2025-02-05 16:08:03,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:08:03,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:08:03,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:08:03,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:08:03,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:08:03,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8d0687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03, skipping insertion in model container [2025-02-05 16:08:03,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:08:03,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c[671,684] [2025-02-05 16:08:03,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:08:03,791 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:08:03,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-2.c[671,684] [2025-02-05 16:08:03,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:08:03,869 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:08:03,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03 WrapperNode [2025-02-05 16:08:03,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:08:03,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:08:03,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:08:03,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:08:03,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,911 INFO L138 Inliner]: procedures = 42, calls = 53, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 555 [2025-02-05 16:08:03,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:08:03,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:08:03,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:08:03,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:08:03,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,951 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-02-05 16:08:03,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:08:03,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:08:03,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:08:03,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:08:03,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (1/1) ... [2025-02-05 16:08:03,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:08:03,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:08:04,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:08:04,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:08:04,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:08:04,038 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:08:04,038 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:08:04,038 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 16:08:04,038 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 16:08:04,038 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 16:08:04,038 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 16:08:04,038 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 16:08:04,038 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 16:08:04,038 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 16:08:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 16:08:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 16:08:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 16:08:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:08:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 16:08:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 16:08:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:08:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:08:04,114 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:08:04,115 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:08:04,599 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-02-05 16:08:04,599 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:08:04,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:08:04,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:08:04,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:08:04 BoogieIcfgContainer [2025-02-05 16:08:04,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:08:04,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:08:04,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:08:04,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:08:04,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:08:03" (1/3) ... [2025-02-05 16:08:04,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26471605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:08:04, skipping insertion in model container [2025-02-05 16:08:04,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:03" (2/3) ... [2025-02-05 16:08:04,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26471605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:08:04, skipping insertion in model container [2025-02-05 16:08:04,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:08:04" (3/3) ... [2025-02-05 16:08:04,626 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.07.cil-2.c [2025-02-05 16:08:04,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:08:04,638 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-02-05 16:08:04,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:08:04,707 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;@20fa93ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:08:04,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:08:04,710 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-02-05 16:08:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:04,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:04,721 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-02-05 16:08:04,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:04,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash -316656410, now seen corresponding path program 1 times [2025-02-05 16:08:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253790025] [2025-02-05 16:08:04,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:04,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:04,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:04,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:05,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253790025] [2025-02-05 16:08:05,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253790025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:05,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:05,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:08:05,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232748311] [2025-02-05 16:08:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:05,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:08:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:05,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:08:05,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:05,186 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-02-05 16:08:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:05,699 INFO L93 Difference]: Finished difference Result 837 states and 1314 transitions. [2025-02-05 16:08:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:08:05,701 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-02-05 16:08:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:05,713 INFO L225 Difference]: With dead ends: 837 [2025-02-05 16:08:05,714 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 16:08:05,718 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-02-05 16:08:05,721 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 761 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-02-05 16:08:05,722 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-02-05 16:08:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 16:08:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 542. [2025-02-05 16:08:05,770 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-02-05 16:08:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 828 transitions. [2025-02-05 16:08:05,778 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 828 transitions. Word has length 123 [2025-02-05 16:08:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:05,779 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 828 transitions. [2025-02-05 16:08:05,780 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-02-05 16:08:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 828 transitions. [2025-02-05 16:08:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:05,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:05,783 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-02-05 16:08:05,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:08:05,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:05,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash -825480604, now seen corresponding path program 1 times [2025-02-05 16:08:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:05,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163781394] [2025-02-05 16:08:05,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:05,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:05,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:05,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:05,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:06,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:06,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163781394] [2025-02-05 16:08:06,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163781394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863702791] [2025-02-05 16:08:06,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:06,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:06,021 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-02-05 16:08:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:06,584 INFO L93 Difference]: Finished difference Result 1404 states and 2167 transitions. [2025-02-05 16:08:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:06,584 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-02-05 16:08:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:06,591 INFO L225 Difference]: With dead ends: 1404 [2025-02-05 16:08:06,591 INFO L226 Difference]: Without dead ends: 877 [2025-02-05 16:08:06,592 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-02-05 16:08:06,593 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-02-05 16:08:06,593 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-02-05 16:08:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-02-05 16:08:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 792. [2025-02-05 16:08:06,629 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-02-05 16:08:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1206 transitions. [2025-02-05 16:08:06,635 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1206 transitions. Word has length 123 [2025-02-05 16:08:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:06,635 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1206 transitions. [2025-02-05 16:08:06,636 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-02-05 16:08:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1206 transitions. [2025-02-05 16:08:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:06,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:06,640 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-02-05 16:08:06,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:08:06,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:06,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash -766259867, now seen corresponding path program 1 times [2025-02-05 16:08:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107546051] [2025-02-05 16:08:06,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:06,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:06,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:06,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:06,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:06,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107546051] [2025-02-05 16:08:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107546051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993900987] [2025-02-05 16:08:06,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:06,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:06,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:06,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:06,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:06,803 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-02-05 16:08:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:07,297 INFO L93 Difference]: Finished difference Result 2194 states and 3380 transitions. [2025-02-05 16:08:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:07,297 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-02-05 16:08:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:07,303 INFO L225 Difference]: With dead ends: 2194 [2025-02-05 16:08:07,303 INFO L226 Difference]: Without dead ends: 1417 [2025-02-05 16:08:07,305 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-02-05 16:08:07,305 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 751 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:07,305 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.4s Time] [2025-02-05 16:08:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2025-02-05 16:08:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1321. [2025-02-05 16:08:07,350 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-02-05 16:08:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 2019 transitions. [2025-02-05 16:08:07,357 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 2019 transitions. Word has length 123 [2025-02-05 16:08:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:07,358 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 2019 transitions. [2025-02-05 16:08:07,359 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-02-05 16:08:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2019 transitions. [2025-02-05 16:08:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:07,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:07,362 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-02-05 16:08:07,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:08:07,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:07,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash -71612860, now seen corresponding path program 1 times [2025-02-05 16:08:07,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:07,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655245182] [2025-02-05 16:08:07,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:07,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:07,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:07,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:07,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655245182] [2025-02-05 16:08:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655245182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:07,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325945837] [2025-02-05 16:08:07,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:07,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:07,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:07,513 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-02-05 16:08:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:08,046 INFO L93 Difference]: Finished difference Result 3885 states and 6031 transitions. [2025-02-05 16:08:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:08,047 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-02-05 16:08:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:08,056 INFO L225 Difference]: With dead ends: 3885 [2025-02-05 16:08:08,056 INFO L226 Difference]: Without dead ends: 2579 [2025-02-05 16:08:08,072 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-02-05 16:08:08,073 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 746 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:08,073 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.4s Time] [2025-02-05 16:08:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2025-02-05 16:08:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2460. [2025-02-05 16:08:08,142 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-02-05 16:08:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3811 transitions. [2025-02-05 16:08:08,153 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3811 transitions. Word has length 123 [2025-02-05 16:08:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:08,154 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 3811 transitions. [2025-02-05 16:08:08,154 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-02-05 16:08:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3811 transitions. [2025-02-05 16:08:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:08,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:08,156 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-02-05 16:08:08,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:08:08,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1059173765, now seen corresponding path program 1 times [2025-02-05 16:08:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584307542] [2025-02-05 16:08:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:08,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:08,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:08,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:08,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584307542] [2025-02-05 16:08:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584307542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:08,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:08,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406386726] [2025-02-05 16:08:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:08,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:08,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:08,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:08,268 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-02-05 16:08:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:08,848 INFO L93 Difference]: Finished difference Result 7572 states and 11985 transitions. [2025-02-05 16:08:08,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:08,848 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-02-05 16:08:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:08,868 INFO L225 Difference]: With dead ends: 7572 [2025-02-05 16:08:08,868 INFO L226 Difference]: Without dead ends: 5127 [2025-02-05 16:08:08,873 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-02-05 16:08:08,874 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-02-05 16:08:08,874 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-02-05 16:08:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2025-02-05 16:08:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 4963. [2025-02-05 16:08:09,064 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-02-05 16:08:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 7883 transitions. [2025-02-05 16:08:09,095 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 7883 transitions. Word has length 123 [2025-02-05 16:08:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:09,095 INFO L471 AbstractCegarLoop]: Abstraction has 4963 states and 7883 transitions. [2025-02-05 16:08:09,095 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-02-05 16:08:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 7883 transitions. [2025-02-05 16:08:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:09,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:09,104 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-02-05 16:08:09,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:08:09,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 125819428, now seen corresponding path program 1 times [2025-02-05 16:08:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643454752] [2025-02-05 16:08:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:09,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:09,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:09,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:09,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:09,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643454752] [2025-02-05 16:08:09,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643454752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:09,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:09,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884312768] [2025-02-05 16:08:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:09,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:09,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:09,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:09,217 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-02-05 16:08:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:09,866 INFO L93 Difference]: Finished difference Result 15787 states and 25827 transitions. [2025-02-05 16:08:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:09,867 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-02-05 16:08:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:09,915 INFO L225 Difference]: With dead ends: 15787 [2025-02-05 16:08:09,915 INFO L226 Difference]: Without dead ends: 10839 [2025-02-05 16:08:09,930 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-02-05 16:08:09,931 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-02-05 16:08:09,931 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-02-05 16:08:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10839 states. [2025-02-05 16:08:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10839 to 10590. [2025-02-05 16:08:10,332 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-02-05 16:08:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10590 states to 10590 states and 17483 transitions. [2025-02-05 16:08:10,383 INFO L78 Accepts]: Start accepts. Automaton has 10590 states and 17483 transitions. Word has length 123 [2025-02-05 16:08:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 10590 states and 17483 transitions. [2025-02-05 16:08:10,384 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-02-05 16:08:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10590 states and 17483 transitions. [2025-02-05 16:08:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:10,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:10,390 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-02-05 16:08:10,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:08:10,391 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:10,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1619731877, now seen corresponding path program 1 times [2025-02-05 16:08:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610075802] [2025-02-05 16:08:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:10,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:10,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:10,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:10,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610075802] [2025-02-05 16:08:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610075802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:10,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348683276] [2025-02-05 16:08:10,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:10,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:10,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:10,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:10,509 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-02-05 16:08:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:11,429 INFO L93 Difference]: Finished difference Result 34526 states and 59377 transitions. [2025-02-05 16:08:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:11,429 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-02-05 16:08:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:11,518 INFO L225 Difference]: With dead ends: 34526 [2025-02-05 16:08:11,518 INFO L226 Difference]: Without dead ends: 23951 [2025-02-05 16:08:11,548 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-02-05 16:08:11,549 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:11,549 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.4s Time] [2025-02-05 16:08:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2025-02-05 16:08:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 23545. [2025-02-05 16:08:12,512 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-02-05 16:08:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23545 states to 23545 states and 41119 transitions. [2025-02-05 16:08:12,643 INFO L78 Accepts]: Start accepts. Automaton has 23545 states and 41119 transitions. Word has length 123 [2025-02-05 16:08:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:12,643 INFO L471 AbstractCegarLoop]: Abstraction has 23545 states and 41119 transitions. [2025-02-05 16:08:12,644 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-02-05 16:08:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23545 states and 41119 transitions. [2025-02-05 16:08:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:12,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:12,654 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-02-05 16:08:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:08:12,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:12,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash 420996612, now seen corresponding path program 1 times [2025-02-05 16:08:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121754678] [2025-02-05 16:08:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:12,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:12,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:12,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:12,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121754678] [2025-02-05 16:08:12,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121754678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:12,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:12,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728958297] [2025-02-05 16:08:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:12,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:12,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:12,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:12,737 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-02-05 16:08:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:14,221 INFO L93 Difference]: Finished difference Result 78293 states and 144743 transitions. [2025-02-05 16:08:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:14,221 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-02-05 16:08:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:14,474 INFO L225 Difference]: With dead ends: 78293 [2025-02-05 16:08:14,475 INFO L226 Difference]: Without dead ends: 54763 [2025-02-05 16:08:14,553 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-02-05 16:08:14,554 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 726 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:14,554 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.4s Time] [2025-02-05 16:08:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54763 states. [2025-02-05 16:08:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54763 to 54072. [2025-02-05 16:08:16,586 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-02-05 16:08:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54072 states to 54072 states and 102279 transitions. [2025-02-05 16:08:16,953 INFO L78 Accepts]: Start accepts. Automaton has 54072 states and 102279 transitions. Word has length 123 [2025-02-05 16:08:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:16,954 INFO L471 AbstractCegarLoop]: Abstraction has 54072 states and 102279 transitions. [2025-02-05 16:08:16,954 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-02-05 16:08:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 54072 states and 102279 transitions. [2025-02-05 16:08:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:16,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:16,970 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-02-05 16:08:16,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:08:16,970 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:16,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 936517061, now seen corresponding path program 1 times [2025-02-05 16:08:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:16,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919654408] [2025-02-05 16:08:16,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:16,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:16,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:16,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:17,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:17,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919654408] [2025-02-05 16:08:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919654408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332021351] [2025-02-05 16:08:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:17,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:17,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:17,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:17,055 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-02-05 16:08:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:20,382 INFO L93 Difference]: Finished difference Result 189688 states and 384662 transitions. [2025-02-05 16:08:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:08:20,382 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-02-05 16:08:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:21,174 INFO L225 Difference]: With dead ends: 189688 [2025-02-05 16:08:21,174 INFO L226 Difference]: Without dead ends: 135631 [2025-02-05 16:08:21,415 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-02-05 16:08:21,416 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 945 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-02-05 16:08:21,416 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-02-05 16:08:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135631 states. [2025-02-05 16:08:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135631 to 127135. [2025-02-05 16:08:27,434 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-02-05 16:08:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127135 states to 127135 states and 269011 transitions. [2025-02-05 16:08:28,358 INFO L78 Accepts]: Start accepts. Automaton has 127135 states and 269011 transitions. Word has length 123 [2025-02-05 16:08:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:28,359 INFO L471 AbstractCegarLoop]: Abstraction has 127135 states and 269011 transitions. [2025-02-05 16:08:28,359 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-02-05 16:08:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 127135 states and 269011 transitions. [2025-02-05 16:08:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:28,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:28,399 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-02-05 16:08:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:08:28,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash -16684572, now seen corresponding path program 1 times [2025-02-05 16:08:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960127283] [2025-02-05 16:08:28,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:28,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:28,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:28,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:28,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:28,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960127283] [2025-02-05 16:08:28,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960127283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:28,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:28,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:08:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482461194] [2025-02-05 16:08:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:08:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:28,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:08:28,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:28,508 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-02-05 16:08:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:34,202 INFO L93 Difference]: Finished difference Result 306759 states and 689368 transitions. [2025-02-05 16:08:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:08:34,203 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-02-05 16:08:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:35,217 INFO L225 Difference]: With dead ends: 306759 [2025-02-05 16:08:35,217 INFO L226 Difference]: Without dead ends: 179639 [2025-02-05 16:08:35,691 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-02-05 16:08:35,692 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 538 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:35,692 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.4s Time] [2025-02-05 16:08:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179639 states. [2025-02-05 16:08:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179639 to 127135. [2025-02-05 16:08:47,930 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-02-05 16:08:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127135 states to 127135 states and 268754 transitions. [2025-02-05 16:08:48,934 INFO L78 Accepts]: Start accepts. Automaton has 127135 states and 268754 transitions. Word has length 123 [2025-02-05 16:08:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:48,934 INFO L471 AbstractCegarLoop]: Abstraction has 127135 states and 268754 transitions. [2025-02-05 16:08:48,934 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-02-05 16:08:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 127135 states and 268754 transitions. [2025-02-05 16:08:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 16:08:48,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:48,971 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-02-05 16:08:48,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:08:48,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:48,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash 783850981, now seen corresponding path program 1 times [2025-02-05 16:08:48,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:48,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384537975] [2025-02-05 16:08:48,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:48,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:49,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 16:08:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 16:08:49,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:49,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384537975] [2025-02-05 16:08:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384537975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:08:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030228457] [2025-02-05 16:08:49,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:49,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:08:49,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:49,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:08:49,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:08:49,323 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)