./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.06.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:53:57,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:53:57,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:53:57,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:53:57,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:53:57,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:53:57,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:53:57,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:53:57,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:53:57,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:53:57,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:53:57,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:53:57,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:53:57,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:53:57,792 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:53:57,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:53:57,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:53:57,793 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:53:57,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:53:57,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:53:57,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:53:57,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:53:57,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:53:57,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:53:57,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:53:57,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:53:57,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:53:57,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:53:57,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:53:57,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:53:57,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:53:57,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:53:57,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:53:57,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:53:57,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ff0d99c6257365cafb7459615c8e1194d53bcc0d71dc100705abd4bb2d65c37 [2025-03-08 05:53:58,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:53:58,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:53:58,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:53:58,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:53:58,105 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:53:58,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2025-03-08 05:53:59,308 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684417f8b/edee8dfe0e0247e29b5ab2b540cb0fe7/FLAG34224edf1 [2025-03-08 05:53:59,563 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:53:59,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2025-03-08 05:53:59,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684417f8b/edee8dfe0e0247e29b5ab2b540cb0fe7/FLAG34224edf1 [2025-03-08 05:53:59,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684417f8b/edee8dfe0e0247e29b5ab2b540cb0fe7 [2025-03-08 05:53:59,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:53:59,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:53:59,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:53:59,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:53:59,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:53:59,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59, skipping insertion in model container [2025-03-08 05:53:59,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:53:59,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-1.c[671,684] [2025-03-08 05:53:59,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:53:59,852 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:53:59,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-1.c[671,684] [2025-03-08 05:53:59,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:53:59,914 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:53:59,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59 WrapperNode [2025-03-08 05:53:59,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:53:59,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:53:59,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:53:59,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:53:59,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,945 INFO L138 Inliner]: procedures = 40, calls = 50, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 498 [2025-03-08 05:53:59,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:53:59,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:53:59,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:53:59,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:53:59,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,969 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:53:59,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:53:59,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:53:59,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:53:59,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:53:59,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (1/1) ... [2025-03-08 05:53:59,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:53:59,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:54:00,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:54:00,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:54:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:54:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 05:54:00,032 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 05:54:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:54:00,032 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:54:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 05:54:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:54:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:54:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:54:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:54:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:54:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:54:00,104 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:54:00,106 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:54:00,624 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-08 05:54:00,624 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:54:00,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:54:00,639 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:54:00,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:54:00 BoogieIcfgContainer [2025-03-08 05:54:00,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:54:00,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:54:00,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:54:00,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:54:00,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:53:59" (1/3) ... [2025-03-08 05:54:00,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d0c013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:54:00, skipping insertion in model container [2025-03-08 05:54:00,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:53:59" (2/3) ... [2025-03-08 05:54:00,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d0c013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:54:00, skipping insertion in model container [2025-03-08 05:54:00,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:54:00" (3/3) ... [2025-03-08 05:54:00,649 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2025-03-08 05:54:00,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:54:00,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-1.c that has 8 procedures, 238 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-08 05:54:00,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:54:00,717 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;@634ed2e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:54:00,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:54:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 211 states have internal predecessors, (332), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 05:54:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:00,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:00,732 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] [2025-03-08 05:54:00,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash -128028807, now seen corresponding path program 1 times [2025-03-08 05:54:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470775444] [2025-03-08 05:54:00,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:00,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:00,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:00,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:00,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470775444] [2025-03-08 05:54:01,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470775444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:01,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032372820] [2025-03-08 05:54:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:01,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:01,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:01,238 INFO L87 Difference]: Start difference. First operand has 238 states, 208 states have (on average 1.5961538461538463) internal successors, (332), 211 states have internal predecessors, (332), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:01,733 INFO L93 Difference]: Finished difference Result 706 states and 1130 transitions. [2025-03-08 05:54:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:54:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:01,748 INFO L225 Difference]: With dead ends: 706 [2025-03-08 05:54:01,748 INFO L226 Difference]: Without dead ends: 474 [2025-03-08 05:54:01,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:01,755 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 658 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:01,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1006 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-08 05:54:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 455. [2025-03-08 05:54:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 404 states have (on average 1.5717821782178218) internal successors, (635), 407 states have internal predecessors, (635), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-08 05:54:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 708 transitions. [2025-03-08 05:54:01,809 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 708 transitions. Word has length 110 [2025-03-08 05:54:01,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:01,809 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 708 transitions. [2025-03-08 05:54:01,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 708 transitions. [2025-03-08 05:54:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:01,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:01,812 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] [2025-03-08 05:54:01,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:54:01,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:01,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1347347191, now seen corresponding path program 1 times [2025-03-08 05:54:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:01,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327579884] [2025-03-08 05:54:01,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:01,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:01,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:01,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:01,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:01,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327579884] [2025-03-08 05:54:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327579884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747571342] [2025-03-08 05:54:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:02,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:02,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:02,015 INFO L87 Difference]: Start difference. First operand 455 states and 708 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:02,541 INFO L93 Difference]: Finished difference Result 1179 states and 1852 transitions. [2025-03-08 05:54:02,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:02,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:02,547 INFO L225 Difference]: With dead ends: 1179 [2025-03-08 05:54:02,547 INFO L226 Difference]: Without dead ends: 738 [2025-03-08 05:54:02,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:02,550 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 651 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:02,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1867 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-03-08 05:54:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 663. [2025-03-08 05:54:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 590 states have (on average 1.564406779661017) internal successors, (923), 594 states have internal predecessors, (923), 52 states have call successors, (52), 19 states have call predecessors, (52), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-08 05:54:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1029 transitions. [2025-03-08 05:54:02,595 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1029 transitions. Word has length 110 [2025-03-08 05:54:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:02,596 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 1029 transitions. [2025-03-08 05:54:02,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1029 transitions. [2025-03-08 05:54:02,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:02,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:02,598 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] [2025-03-08 05:54:02,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:54:02,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:02,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash 905592696, now seen corresponding path program 1 times [2025-03-08 05:54:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:02,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385522694] [2025-03-08 05:54:02,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:02,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:02,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:02,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:02,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385522694] [2025-03-08 05:54:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385522694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:02,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:02,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311441880] [2025-03-08 05:54:02,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:02,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:02,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:02,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:02,794 INFO L87 Difference]: Start difference. First operand 663 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:03,253 INFO L93 Difference]: Finished difference Result 1837 states and 2882 transitions. [2025-03-08 05:54:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:03,261 INFO L225 Difference]: With dead ends: 1837 [2025-03-08 05:54:03,261 INFO L226 Difference]: Without dead ends: 1188 [2025-03-08 05:54:03,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:03,265 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 646 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:03,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1851 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-08 05:54:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1104. [2025-03-08 05:54:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 985 states have (on average 1.565482233502538) internal successors, (1542), 993 states have internal predecessors, (1542), 82 states have call successors, (82), 31 states have call predecessors, (82), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-08 05:54:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1720 transitions. [2025-03-08 05:54:03,329 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1720 transitions. Word has length 110 [2025-03-08 05:54:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:03,329 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1720 transitions. [2025-03-08 05:54:03,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1720 transitions. [2025-03-08 05:54:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:03,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:03,331 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] [2025-03-08 05:54:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:54:03,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:03,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:03,331 INFO L85 PathProgramCache]: Analyzing trace with hash 891342551, now seen corresponding path program 1 times [2025-03-08 05:54:03,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-03-08 05:54:03,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:03,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:03,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:03,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:03,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:03,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:03,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-03-08 05:54:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122790998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:03,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:03,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986774512] [2025-03-08 05:54:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:03,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:03,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:03,455 INFO L87 Difference]: Start difference. First operand 1104 states and 1720 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:03,974 INFO L93 Difference]: Finished difference Result 3248 states and 5135 transitions. [2025-03-08 05:54:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:03,985 INFO L225 Difference]: With dead ends: 3248 [2025-03-08 05:54:03,985 INFO L226 Difference]: Without dead ends: 2158 [2025-03-08 05:54:03,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:03,989 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 641 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:03,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1839 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-03-08 05:54:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2055. [2025-03-08 05:54:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1838 states have (on average 1.5767138193688792) internal successors, (2898), 1860 states have internal predecessors, (2898), 142 states have call successors, (142), 55 states have call predecessors, (142), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-08 05:54:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3244 transitions. [2025-03-08 05:54:04,096 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3244 transitions. Word has length 110 [2025-03-08 05:54:04,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:04,097 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3244 transitions. [2025-03-08 05:54:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3244 transitions. [2025-03-08 05:54:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:04,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:04,100 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] [2025-03-08 05:54:04,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:54:04,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:04,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash -78948456, now seen corresponding path program 1 times [2025-03-08 05:54:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573203479] [2025-03-08 05:54:04,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:04,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:04,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:04,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573203479] [2025-03-08 05:54:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573203479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:04,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199089151] [2025-03-08 05:54:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:04,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:04,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:04,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:04,200 INFO L87 Difference]: Start difference. First operand 2055 states and 3244 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:04,804 INFO L93 Difference]: Finished difference Result 6327 states and 10197 transitions. [2025-03-08 05:54:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:04,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:04,825 INFO L225 Difference]: With dead ends: 6327 [2025-03-08 05:54:04,826 INFO L226 Difference]: Without dead ends: 4286 [2025-03-08 05:54:04,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:04,834 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 636 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:04,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1827 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-03-08 05:54:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4146. [2025-03-08 05:54:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4146 states, 3715 states have (on average 1.5962314939434723) internal successors, (5930), 3783 states have internal predecessors, (5930), 262 states have call successors, (262), 103 states have call predecessors, (262), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-08 05:54:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 4146 states and 6708 transitions. [2025-03-08 05:54:05,016 INFO L78 Accepts]: Start accepts. Automaton has 4146 states and 6708 transitions. Word has length 110 [2025-03-08 05:54:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:05,016 INFO L471 AbstractCegarLoop]: Abstraction has 4146 states and 6708 transitions. [2025-03-08 05:54:05,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4146 states and 6708 transitions. [2025-03-08 05:54:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:05,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:05,020 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] [2025-03-08 05:54:05,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:54:05,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:05,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 859583159, now seen corresponding path program 1 times [2025-03-08 05:54:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827264638] [2025-03-08 05:54:05,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:05,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:05,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:05,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:05,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:05,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:05,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827264638] [2025-03-08 05:54:05,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827264638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:05,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:05,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:05,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708470449] [2025-03-08 05:54:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:05,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:05,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:05,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:05,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:05,164 INFO L87 Difference]: Start difference. First operand 4146 states and 6708 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:05,814 INFO L93 Difference]: Finished difference Result 13182 states and 21967 transitions. [2025-03-08 05:54:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:05,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:05,855 INFO L225 Difference]: With dead ends: 13182 [2025-03-08 05:54:05,855 INFO L226 Difference]: Without dead ends: 9050 [2025-03-08 05:54:05,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:05,866 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 658 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:05,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1274 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9050 states. [2025-03-08 05:54:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9050 to 8841. [2025-03-08 05:54:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 7928 states have (on average 1.620837537840565) internal successors, (12850), 8142 states have internal predecessors, (12850), 502 states have call successors, (502), 199 states have call predecessors, (502), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-08 05:54:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 14876 transitions. [2025-03-08 05:54:06,287 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 14876 transitions. Word has length 110 [2025-03-08 05:54:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:06,288 INFO L471 AbstractCegarLoop]: Abstraction has 8841 states and 14876 transitions. [2025-03-08 05:54:06,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 14876 transitions. [2025-03-08 05:54:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:06,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:06,296 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] [2025-03-08 05:54:06,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:54:06,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 474216376, now seen corresponding path program 1 times [2025-03-08 05:54:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871244011] [2025-03-08 05:54:06,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:06,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:06,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:06,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:06,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871244011] [2025-03-08 05:54:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871244011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:06,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109860008] [2025-03-08 05:54:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:06,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:06,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:06,414 INFO L87 Difference]: Start difference. First operand 8841 states and 14876 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:07,512 INFO L93 Difference]: Finished difference Result 29995 states and 52226 transitions. [2025-03-08 05:54:07,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:07,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:07,648 INFO L225 Difference]: With dead ends: 29995 [2025-03-08 05:54:07,648 INFO L226 Difference]: Without dead ends: 21168 [2025-03-08 05:54:07,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:07,686 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 817 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:07,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1776 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21168 states. [2025-03-08 05:54:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21168 to 19269. [2025-03-08 05:54:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19269 states, 17262 states have (on average 1.6447688564476886) internal successors, (28392), 17930 states have internal predecessors, (28392), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-08 05:54:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 34386 transitions. [2025-03-08 05:54:08,810 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 34386 transitions. Word has length 110 [2025-03-08 05:54:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:08,811 INFO L471 AbstractCegarLoop]: Abstraction has 19269 states and 34386 transitions. [2025-03-08 05:54:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 34386 transitions. [2025-03-08 05:54:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:08,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:08,825 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] [2025-03-08 05:54:08,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:54:08,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:08,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1966405383, now seen corresponding path program 1 times [2025-03-08 05:54:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428425446] [2025-03-08 05:54:08,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:08,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:08,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:08,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:08,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428425446] [2025-03-08 05:54:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428425446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836044007] [2025-03-08 05:54:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:08,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:08,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:08,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:08,953 INFO L87 Difference]: Start difference. First operand 19269 states and 34386 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:09,981 INFO L93 Difference]: Finished difference Result 43641 states and 81018 transitions. [2025-03-08 05:54:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:54:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:10,115 INFO L225 Difference]: With dead ends: 43641 [2025-03-08 05:54:10,115 INFO L226 Difference]: Without dead ends: 24386 [2025-03-08 05:54:10,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:10,185 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 462 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:10,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 661 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:54:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24386 states. [2025-03-08 05:54:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24386 to 19269. [2025-03-08 05:54:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19269 states, 17262 states have (on average 1.6410033599814622) internal successors, (28327), 17930 states have internal predecessors, (28327), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-08 05:54:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 34321 transitions. [2025-03-08 05:54:11,401 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 34321 transitions. Word has length 110 [2025-03-08 05:54:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:11,404 INFO L471 AbstractCegarLoop]: Abstraction has 19269 states and 34321 transitions. [2025-03-08 05:54:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 34321 transitions. [2025-03-08 05:54:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:11,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:11,418 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] [2025-03-08 05:54:11,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:54:11,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -798209128, now seen corresponding path program 1 times [2025-03-08 05:54:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:11,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342466197] [2025-03-08 05:54:11,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:11,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:11,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:11,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:11,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342466197] [2025-03-08 05:54:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342466197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:11,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166745427] [2025-03-08 05:54:11,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:11,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:11,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:11,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:11,558 INFO L87 Difference]: Start difference. First operand 19269 states and 34321 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:13,546 INFO L93 Difference]: Finished difference Result 64439 states and 121279 transitions. [2025-03-08 05:54:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:13,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:13,762 INFO L225 Difference]: With dead ends: 64439 [2025-03-08 05:54:13,763 INFO L226 Difference]: Without dead ends: 45184 [2025-03-08 05:54:13,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:13,830 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 744 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:13,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 1745 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:54:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45184 states. [2025-03-08 05:54:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45184 to 42459. [2025-03-08 05:54:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42459 states, 37810 states have (on average 1.6570483998942078) internal successors, (62653), 39872 states have internal predecessors, (62653), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 05:54:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42459 states to 42459 states and 82663 transitions. [2025-03-08 05:54:16,115 INFO L78 Accepts]: Start accepts. Automaton has 42459 states and 82663 transitions. Word has length 110 [2025-03-08 05:54:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:16,117 INFO L471 AbstractCegarLoop]: Abstraction has 42459 states and 82663 transitions. [2025-03-08 05:54:16,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 42459 states and 82663 transitions. [2025-03-08 05:54:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:16,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:16,141 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] [2025-03-08 05:54:16,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:54:16,142 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:16,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2007451367, now seen corresponding path program 1 times [2025-03-08 05:54:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:16,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351110616] [2025-03-08 05:54:16,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:16,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:16,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:16,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:16,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:16,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:16,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351110616] [2025-03-08 05:54:16,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351110616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:16,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:16,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:54:16,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725537891] [2025-03-08 05:54:16,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:16,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:54:16,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:16,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:54:16,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:54:16,247 INFO L87 Difference]: Start difference. First operand 42459 states and 82663 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:18,805 INFO L93 Difference]: Finished difference Result 95849 states and 197270 transitions. [2025-03-08 05:54:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:54:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:19,360 INFO L225 Difference]: With dead ends: 95849 [2025-03-08 05:54:19,361 INFO L226 Difference]: Without dead ends: 53404 [2025-03-08 05:54:19,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:19,447 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 458 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:19,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 647 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:54:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53404 states. [2025-03-08 05:54:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53404 to 42459. [2025-03-08 05:54:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42459 states, 37810 states have (on average 1.6536366040729966) internal successors, (62524), 39872 states have internal predecessors, (62524), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-08 05:54:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42459 states to 42459 states and 82534 transitions. [2025-03-08 05:54:22,116 INFO L78 Accepts]: Start accepts. Automaton has 42459 states and 82534 transitions. Word has length 110 [2025-03-08 05:54:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:22,117 INFO L471 AbstractCegarLoop]: Abstraction has 42459 states and 82534 transitions. [2025-03-08 05:54:22,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 42459 states and 82534 transitions. [2025-03-08 05:54:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:22,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:22,141 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] [2025-03-08 05:54:22,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:54:22,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash -799533192, now seen corresponding path program 1 times [2025-03-08 05:54:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:22,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587810105] [2025-03-08 05:54:22,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:22,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:22,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:22,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587810105] [2025-03-08 05:54:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587810105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:22,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:22,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:22,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246748684] [2025-03-08 05:54:22,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:22,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:22,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:22,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:22,275 INFO L87 Difference]: Start difference. First operand 42459 states and 82534 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:54:26,160 INFO L93 Difference]: Finished difference Result 138825 states and 295656 transitions. [2025-03-08 05:54:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:54:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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 110 [2025-03-08 05:54:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:54:26,938 INFO L225 Difference]: With dead ends: 138825 [2025-03-08 05:54:26,938 INFO L226 Difference]: Without dead ends: 96380 [2025-03-08 05:54:27,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:54:27,061 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 671 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:54:27,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1714 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:54:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96380 states. [2025-03-08 05:54:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96380 to 93021. [2025-03-08 05:54:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93021 states, 81694 states have (on average 1.6553235243714348) internal successors, (135230), 88002 states have internal predecessors, (135230), 3478 states have call successors, (3478), 1543 states have call predecessors, (3478), 7848 states have return successors, (69012), 3731 states have call predecessors, (69012), 3476 states have call successors, (69012) [2025-03-08 05:54:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93021 states to 93021 states and 207720 transitions. [2025-03-08 05:54:34,526 INFO L78 Accepts]: Start accepts. Automaton has 93021 states and 207720 transitions. Word has length 110 [2025-03-08 05:54:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:54:34,526 INFO L471 AbstractCegarLoop]: Abstraction has 93021 states and 207720 transitions. [2025-03-08 05:54:34,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:54:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 93021 states and 207720 transitions. [2025-03-08 05:54:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:54:34,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:54:34,556 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] [2025-03-08 05:54:34,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:54:34,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:54:34,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:54:34,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2010378553, now seen corresponding path program 1 times [2025-03-08 05:54:34,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:54:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711867555] [2025-03-08 05:54:34,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:54:34,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:54:34,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:54:34,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:54:34,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:54:34,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:54:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:54:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:54:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711867555] [2025-03-08 05:54:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711867555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:54:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:54:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:54:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043344293] [2025-03-08 05:54:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:54:34,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:54:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:54:34,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:54:34,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:54:34,650 INFO L87 Difference]: Start difference. First operand 93021 states and 207720 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 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)