./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.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-?-798a7b3-m [2025-03-03 14:43:59,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:43:59,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:43:59,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:43:59,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:43:59,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:43:59,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:43:59,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:43:59,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:43:59,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:43:59,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:43:59,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:43:59,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:43:59,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:43:59,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:43:59,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:43:59,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:43:59,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:43:59,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:43:59,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:43:59,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:43:59,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:43:59,849 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-03 14:44:00,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:44:00,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:44:00,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:44:00,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:44:00,097 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:44:00,098 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-03 14:44:01,275 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cdd2442/d542009f3e264e64bf03d3779c444712/FLAG80d0fd9dd [2025-03-03 14:44:01,471 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:44:01,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-1.c [2025-03-03 14:44:01,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cdd2442/d542009f3e264e64bf03d3779c444712/FLAG80d0fd9dd [2025-03-03 14:44:01,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35cdd2442/d542009f3e264e64bf03d3779c444712 [2025-03-03 14:44:01,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:44:01,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:44:01,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:01,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:44:01,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:44:01,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e94045c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01, skipping insertion in model container [2025-03-03 14:44:01,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:44:01,618 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-03 14:44:01,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:01,712 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:44:01,720 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-03 14:44:01,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:01,784 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:44:01,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01 WrapperNode [2025-03-03 14:44:01,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:01,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:01,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:44:01,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:44:01,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,824 INFO L138 Inliner]: procedures = 40, calls = 50, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 498 [2025-03-03 14:44:01,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:01,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:44:01,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:44:01,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:44:01,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,840 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:44:01,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:44:01,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:44:01,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:44:01,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:44:01,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (1/1) ... [2025-03-03 14:44:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:01,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:44:01,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:44:01,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:44:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:44:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 14:44:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 14:44:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 14:44:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 14:44:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 14:44:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 14:44:01,893 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 14:44:01,893 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 14:44:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 14:44:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 14:44:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 14:44:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 14:44:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:44:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 14:44:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 14:44:01,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:44:01,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:44:01,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:44:01,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:44:02,395 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-03 14:44:02,396 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:44:02,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:44:02,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:44:02,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:02 BoogieIcfgContainer [2025-03-03 14:44:02,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:44:02,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:44:02,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:44:02,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:44:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:44:01" (1/3) ... [2025-03-03 14:44:02,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78131b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:02, skipping insertion in model container [2025-03-03 14:44:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:01" (2/3) ... [2025-03-03 14:44:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78131b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:02, skipping insertion in model container [2025-03-03 14:44:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:02" (3/3) ... [2025-03-03 14:44:02,420 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2025-03-03 14:44:02,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:44:02,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.06.cil-1.c that has 8 procedures, 254 locations, 1 initial locations, 9 loop locations, and 1 error locations. [2025-03-03 14:44:02,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:44:02,483 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;@61f31092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:44:02,483 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:44:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 254 states, 223 states have (on average 1.5605381165919283) internal successors, (348), 227 states have internal predecessors, (348), 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-03 14:44:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:02,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:02,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:02,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:02,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:02,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1117801751, now seen corresponding path program 1 times [2025-03-03 14:44:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:02,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-03-03 14:44:02,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:02,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:02,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:02,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:02,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:02,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:02,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-03-03 14:44:02,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117471825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:02,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:02,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694379294] [2025-03-03 14:44:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:02,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:02,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:02,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:02,973 INFO L87 Difference]: Start difference. First operand has 254 states, 223 states have (on average 1.5605381165919283) internal successors, (348), 227 states have internal predecessors, (348), 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 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:03,410 INFO L93 Difference]: Finished difference Result 754 states and 1178 transitions. [2025-03-03 14:44:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:44:03,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:03,421 INFO L225 Difference]: With dead ends: 754 [2025-03-03 14:44:03,421 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:44:03,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:03,428 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 674 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1070 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:03,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1070 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:44:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:44:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 487. [2025-03-03 14:44:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 436 states have (on average 1.5298165137614679) internal successors, (667), 439 states have internal predecessors, (667), 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-03 14:44:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 740 transitions. [2025-03-03 14:44:03,494 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 740 transitions. Word has length 112 [2025-03-03 14:44:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 740 transitions. [2025-03-03 14:44:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 740 transitions. [2025-03-03 14:44:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:03,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:03,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:03,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:44:03,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1614928149, now seen corresponding path program 1 times [2025-03-03 14:44:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83918319] [2025-03-03 14:44:03,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:03,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:03,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:03,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:03,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83918319] [2025-03-03 14:44:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83918319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685058724] [2025-03-03 14:44:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:03,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:03,692 INFO L87 Difference]: Start difference. First operand 487 states and 740 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:04,204 INFO L93 Difference]: Finished difference Result 1259 states and 1932 transitions. [2025-03-03 14:44:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:04,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:04,212 INFO L225 Difference]: With dead ends: 1259 [2025-03-03 14:44:04,212 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 14:44:04,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:04,217 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 667 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 2011 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-03 14:44:04,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 2011 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 14:44:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 711. [2025-03-03 14:44:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 638 states have (on average 1.5219435736677116) internal successors, (971), 642 states have internal predecessors, (971), 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-03 14:44:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1077 transitions. [2025-03-03 14:44:04,265 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1077 transitions. Word has length 112 [2025-03-03 14:44:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:04,266 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1077 transitions. [2025-03-03 14:44:04,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1077 transitions. [2025-03-03 14:44:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:04,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:04,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:04,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:44:04,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:04,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2004346538, now seen corresponding path program 1 times [2025-03-03 14:44:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532988599] [2025-03-03 14:44:04,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:04,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:04,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:04,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:04,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532988599] [2025-03-03 14:44:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532988599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:04,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:04,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8826070] [2025-03-03 14:44:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:04,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:04,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:04,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:04,462 INFO L87 Difference]: Start difference. First operand 711 states and 1077 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:04,948 INFO L93 Difference]: Finished difference Result 1965 states and 3010 transitions. [2025-03-03 14:44:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:04,955 INFO L225 Difference]: With dead ends: 1965 [2025-03-03 14:44:04,955 INFO L226 Difference]: Without dead ends: 1268 [2025-03-03 14:44:04,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:04,957 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 662 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1995 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-03 14:44:04,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1995 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-03 14:44:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1184. [2025-03-03 14:44:05,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1065 states have (on average 1.5230046948356808) internal successors, (1622), 1073 states have internal predecessors, (1622), 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-03 14:44:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1800 transitions. [2025-03-03 14:44:05,020 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1800 transitions. Word has length 112 [2025-03-03 14:44:05,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:05,020 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1800 transitions. [2025-03-03 14:44:05,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1800 transitions. [2025-03-03 14:44:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:05,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:05,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:44:05,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1481133301, now seen corresponding path program 1 times [2025-03-03 14:44:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-03-03 14:44:05,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:05,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:05,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:05,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:05,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:05,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:05,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-03-03 14:44:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036216619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:05,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:05,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:05,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92022800] [2025-03-03 14:44:05,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:05,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:05,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:05,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:05,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:05,166 INFO L87 Difference]: Start difference. First operand 1184 states and 1800 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:05,682 INFO L93 Difference]: Finished difference Result 3472 states and 5359 transitions. [2025-03-03 14:44:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:05,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:05,691 INFO L225 Difference]: With dead ends: 3472 [2025-03-03 14:44:05,692 INFO L226 Difference]: Without dead ends: 2302 [2025-03-03 14:44:05,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:05,694 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 657 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1983 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-03 14:44:05,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1983 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2025-03-03 14:44:05,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2199. [2025-03-03 14:44:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1982 states have (on average 1.5348133198789102) internal successors, (3042), 2004 states have internal predecessors, (3042), 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-03 14:44:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3388 transitions. [2025-03-03 14:44:05,790 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3388 transitions. Word has length 112 [2025-03-03 14:44:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 3388 transitions. [2025-03-03 14:44:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3388 transitions. [2025-03-03 14:44:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:05,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:05,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:05,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:44:05,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:05,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1039378806, now seen corresponding path program 1 times [2025-03-03 14:44:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935339788] [2025-03-03 14:44:05,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:05,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:05,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:05,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935339788] [2025-03-03 14:44:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935339788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334690166] [2025-03-03 14:44:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:05,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:05,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:05,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:05,891 INFO L87 Difference]: Start difference. First operand 2199 states and 3388 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:06,415 INFO L93 Difference]: Finished difference Result 6743 states and 10613 transitions. [2025-03-03 14:44:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:06,437 INFO L225 Difference]: With dead ends: 6743 [2025-03-03 14:44:06,437 INFO L226 Difference]: Without dead ends: 4558 [2025-03-03 14:44:06,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:06,446 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 652 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1971 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-03 14:44:06,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1971 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2025-03-03 14:44:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 4418. [2025-03-03 14:44:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 3987 states have (on average 1.5555555555555556) internal successors, (6202), 4055 states have internal predecessors, (6202), 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-03 14:44:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6980 transitions. [2025-03-03 14:44:06,633 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 6980 transitions. Word has length 112 [2025-03-03 14:44:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:06,634 INFO L471 AbstractCegarLoop]: Abstraction has 4418 states and 6980 transitions. [2025-03-03 14:44:06,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 6980 transitions. [2025-03-03 14:44:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:06,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:06,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:06,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:44:06,641 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1025128661, now seen corresponding path program 1 times [2025-03-03 14:44:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646682316] [2025-03-03 14:44:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:06,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:06,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:06,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:06,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646682316] [2025-03-03 14:44:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646682316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665314846] [2025-03-03 14:44:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:06,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:06,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:06,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:06,754 INFO L87 Difference]: Start difference. First operand 4418 states and 6980 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:07,322 INFO L93 Difference]: Finished difference Result 13982 states and 22767 transitions. [2025-03-03 14:44:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:07,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:07,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:07,375 INFO L225 Difference]: With dead ends: 13982 [2025-03-03 14:44:07,375 INFO L226 Difference]: Without dead ends: 9578 [2025-03-03 14:44:07,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:07,391 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 674 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1354 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:07,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1354 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:44:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9578 states. [2025-03-03 14:44:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9578 to 9369. [2025-03-03 14:44:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9369 states, 8456 states have (on average 1.5820719016083256) internal successors, (13378), 8670 states have internal predecessors, (13378), 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-03 14:44:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 15404 transitions. [2025-03-03 14:44:07,816 INFO L78 Accepts]: Start accepts. Automaton has 9369 states and 15404 transitions. Word has length 112 [2025-03-03 14:44:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 9369 states and 15404 transitions. [2025-03-03 14:44:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9369 states and 15404 transitions. [2025-03-03 14:44:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:07,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:07,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:07,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:44:07,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 54837654, now seen corresponding path program 1 times [2025-03-03 14:44:07,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:07,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822733744] [2025-03-03 14:44:07,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:07,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:07,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:07,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:07,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822733744] [2025-03-03 14:44:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822733744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253383938] [2025-03-03 14:44:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:07,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:07,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:07,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:07,937 INFO L87 Difference]: Start difference. First operand 9369 states and 15404 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:08,815 INFO L93 Difference]: Finished difference Result 31563 states and 53794 transitions. [2025-03-03 14:44:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:08,901 INFO L225 Difference]: With dead ends: 31563 [2025-03-03 14:44:08,902 INFO L226 Difference]: Without dead ends: 22208 [2025-03-03 14:44:08,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:08,929 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 833 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1920 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-03 14:44:08,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1920 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22208 states. [2025-03-03 14:44:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22208 to 20309. [2025-03-03 14:44:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20309 states, 18302 states have (on average 1.6081302589880888) internal successors, (29432), 18970 states have internal predecessors, (29432), 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-03 14:44:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20309 states to 20309 states and 35426 transitions. [2025-03-03 14:44:09,807 INFO L78 Accepts]: Start accepts. Automaton has 20309 states and 35426 transitions. Word has length 112 [2025-03-03 14:44:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:09,808 INFO L471 AbstractCegarLoop]: Abstraction has 20309 states and 35426 transitions. [2025-03-03 14:44:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20309 states and 35426 transitions. [2025-03-03 14:44:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:09,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:09,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:09,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:44:09,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:09,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash -330529129, now seen corresponding path program 1 times [2025-03-03 14:44:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:09,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509196089] [2025-03-03 14:44:09,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:09,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:09,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:09,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:09,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:09,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:09,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509196089] [2025-03-03 14:44:09,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509196089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:09,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914003148] [2025-03-03 14:44:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:09,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:09,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:09,932 INFO L87 Difference]: Start difference. First operand 20309 states and 35426 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:11,003 INFO L93 Difference]: Finished difference Result 45721 states and 83098 transitions. [2025-03-03 14:44:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:11,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:11,121 INFO L225 Difference]: With dead ends: 45721 [2025-03-03 14:44:11,122 INFO L226 Difference]: Without dead ends: 25426 [2025-03-03 14:44:11,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:11,184 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 478 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 709 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-03 14:44:11,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 709 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:44:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25426 states. [2025-03-03 14:44:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25426 to 20309. [2025-03-03 14:44:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20309 states, 18302 states have (on average 1.6045787345645284) internal successors, (29367), 18970 states have internal predecessors, (29367), 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-03 14:44:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20309 states to 20309 states and 35361 transitions. [2025-03-03 14:44:12,054 INFO L78 Accepts]: Start accepts. Automaton has 20309 states and 35361 transitions. Word has length 112 [2025-03-03 14:44:12,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:12,055 INFO L471 AbstractCegarLoop]: Abstraction has 20309 states and 35361 transitions. [2025-03-03 14:44:12,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20309 states and 35361 transitions. [2025-03-03 14:44:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:12,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:12,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:12,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:44:12,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:12,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1319607670, now seen corresponding path program 1 times [2025-03-03 14:44:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361774187] [2025-03-03 14:44:12,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:12,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:12,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:12,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:12,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:12,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361774187] [2025-03-03 14:44:12,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361774187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:12,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:12,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966811760] [2025-03-03 14:44:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:12,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:12,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:12,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:12,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:12,156 INFO L87 Difference]: Start difference. First operand 20309 states and 35361 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:13,846 INFO L93 Difference]: Finished difference Result 67543 states and 124383 transitions. [2025-03-03 14:44:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:13,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:14,048 INFO L225 Difference]: With dead ends: 67543 [2025-03-03 14:44:14,049 INFO L226 Difference]: Without dead ends: 47248 [2025-03-03 14:44:14,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:14,113 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 760 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1889 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-03 14:44:14,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1889 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:44:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47248 states. [2025-03-03 14:44:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47248 to 44523. [2025-03-03 14:44:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44523 states, 39874 states have (on average 1.6230375683402718) internal successors, (64717), 41936 states have internal predecessors, (64717), 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-03 14:44:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44523 states to 44523 states and 84727 transitions. [2025-03-03 14:44:16,318 INFO L78 Accepts]: Start accepts. Automaton has 44523 states and 84727 transitions. Word has length 112 [2025-03-03 14:44:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:16,319 INFO L471 AbstractCegarLoop]: Abstraction has 44523 states and 84727 transitions. [2025-03-03 14:44:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 44523 states and 84727 transitions. [2025-03-03 14:44:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:16,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:16,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:16,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:44:16,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:16,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1121014089, now seen corresponding path program 1 times [2025-03-03 14:44:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:16,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196040319] [2025-03-03 14:44:16,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:16,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:16,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:16,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:16,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:16,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:16,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196040319] [2025-03-03 14:44:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196040319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:16,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:16,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307005232] [2025-03-03 14:44:16,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:16,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:16,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:16,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:16,410 INFO L87 Difference]: Start difference. First operand 44523 states and 84727 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:18,225 INFO L93 Difference]: Finished difference Result 99977 states and 201398 transitions. [2025-03-03 14:44:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:18,512 INFO L225 Difference]: With dead ends: 99977 [2025-03-03 14:44:18,512 INFO L226 Difference]: Without dead ends: 55468 [2025-03-03 14:44:18,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:18,639 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 474 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 695 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-03 14:44:18,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 695 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:44:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55468 states. [2025-03-03 14:44:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55468 to 44523. [2025-03-03 14:44:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44523 states, 39874 states have (on average 1.6198023774890906) internal successors, (64588), 41936 states have internal predecessors, (64588), 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-03 14:44:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44523 states to 44523 states and 84598 transitions. [2025-03-03 14:44:22,196 INFO L78 Accepts]: Start accepts. Automaton has 44523 states and 84598 transitions. Word has length 112 [2025-03-03 14:44:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 44523 states and 84598 transitions. [2025-03-03 14:44:22,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 44523 states and 84598 transitions. [2025-03-03 14:44:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:22,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:22,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:22,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:44:22,213 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 47182166, now seen corresponding path program 1 times [2025-03-03 14:44:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525488355] [2025-03-03 14:44:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:22,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:22,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525488355] [2025-03-03 14:44:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525488355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239436898] [2025-03-03 14:44:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:22,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:22,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:22,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:22,308 INFO L87 Difference]: Start difference. First operand 44523 states and 84598 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:25,933 INFO L93 Difference]: Finished difference Result 145001 states and 301832 transitions. [2025-03-03 14:44:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:44:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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 112 [2025-03-03 14:44:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:26,451 INFO L225 Difference]: With dead ends: 145001 [2025-03-03 14:44:26,451 INFO L226 Difference]: Without dead ends: 100492 [2025-03-03 14:44:26,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:44:26,603 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 687 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1858 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-03 14:44:26,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1858 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:44:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100492 states. [2025-03-03 14:44:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100492 to 97133. [2025-03-03 14:44:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97133 states, 85806 states have (on average 1.6239190732582802) internal successors, (139342), 92114 states have internal predecessors, (139342), 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-03 14:44:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97133 states to 97133 states and 211832 transitions. [2025-03-03 14:44:33,212 INFO L78 Accepts]: Start accepts. Automaton has 97133 states and 211832 transitions. Word has length 112 [2025-03-03 14:44:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:33,212 INFO L471 AbstractCegarLoop]: Abstraction has 97133 states and 211832 transitions. [2025-03-03 14:44:33,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:44:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 97133 states and 211832 transitions. [2025-03-03 14:44:33,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:44:33,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:33,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:33,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:44:33,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1162060073, now seen corresponding path program 1 times [2025-03-03 14:44:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897311175] [2025-03-03 14:44:33,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:33,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:44:33,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:44:33,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:33,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897311175] [2025-03-03 14:44:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897311175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:44:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753571592] [2025-03-03 14:44:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:33,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:44:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:44:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:44:33,347 INFO L87 Difference]: Start difference. First operand 97133 states and 211832 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 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)