./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c7bda6ec8155a470f5f9e07367696d7e5cc6867667668ebd692704e4077816f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:21:14,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:21:14,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:21:14,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:21:14,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:21:14,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:21:14,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:21:14,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:21:14,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:21:14,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:21:14,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:21:14,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:21:14,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:21:14,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:21:14,809 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:21:14,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:21:14,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:21:14,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:21:14,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:21:14,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:21:14,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:21:14,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:21:14,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:21:14,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:21:14,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:21:14,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:21:14,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:21:14,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:21:14,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:21:14,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:21:14,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:21:14,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:21:14,813 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6c7bda6ec8155a470f5f9e07367696d7e5cc6867667668ebd692704e4077816f [2025-01-09 04:21:15,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:21:15,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:21:15,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:21:15,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:21:15,091 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:21:15,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2025-01-09 04:21:16,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5e2040b/91e7d38647b14fb4be3bfeb344b70fa3/FLAGaef23615c [2025-01-09 04:21:16,600 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:21:16,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c [2025-01-09 04:21:16,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5e2040b/91e7d38647b14fb4be3bfeb344b70fa3/FLAGaef23615c [2025-01-09 04:21:16,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd5e2040b/91e7d38647b14fb4be3bfeb344b70fa3 [2025-01-09 04:21:16,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:21:16,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:21:16,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:21:16,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:21:16,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:21:16,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:16,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610356d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16, skipping insertion in model container [2025-01-09 04:21:16,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:16,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:21:16,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2025-01-09 04:21:16,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:21:16,858 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:21:16,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.ufo.BOUNDED-8.pals.c[28192,28205] [2025-01-09 04:21:16,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:21:16,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:21:16,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16 WrapperNode [2025-01-09 04:21:16,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:21:16,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:21:16,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:21:16,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:21:16,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:16,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:16,995 INFO L138 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 955 [2025-01-09 04:21:16,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:21:16,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:21:16,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:21:16,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:21:17,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,017 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-01-09 04:21:17,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:21:17,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:21:17,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:21:17,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:21:17,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (1/1) ... [2025-01-09 04:21:17,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:21:17,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:21:17,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:21:17,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:21:17,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:21:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:21:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:21:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:21:17,194 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:21:17,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:21:18,041 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-01-09 04:21:18,042 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:21:18,058 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:21:18,058 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:21:18,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:18 BoogieIcfgContainer [2025-01-09 04:21:18,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:21:18,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:21:18,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:21:18,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:21:18,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:21:16" (1/3) ... [2025-01-09 04:21:18,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660a3fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:21:18, skipping insertion in model container [2025-01-09 04:21:18,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:16" (2/3) ... [2025-01-09 04:21:18,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660a3fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:21:18, skipping insertion in model container [2025-01-09 04:21:18,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:18" (3/3) ... [2025-01-09 04:21:18,071 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c [2025-01-09 04:21:18,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:21:18,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c that has 1 procedures, 279 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:21:18,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:21:18,136 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;@14e3c921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:21:18,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:21:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 277 states have (on average 1.8339350180505416) internal successors, (508), 278 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:21:18,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:18,147 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] [2025-01-09 04:21:18,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:18,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -367518056, now seen corresponding path program 1 times [2025-01-09 04:21:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642728674] [2025-01-09 04:21:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:18,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:21:18,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:21:18,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:18,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:18,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642728674] [2025-01-09 04:21:18,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642728674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:18,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:18,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:21:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076344354] [2025-01-09 04:21:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:18,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:21:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:18,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:21:18,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:21:18,619 INFO L87 Difference]: Start difference. First operand has 279 states, 277 states have (on average 1.8339350180505416) internal successors, (508), 278 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:18,646 INFO L93 Difference]: Finished difference Result 367 states and 662 transitions. [2025-01-09 04:21:18,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:21:18,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:21:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:18,683 INFO L225 Difference]: With dead ends: 367 [2025-01-09 04:21:18,684 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 04:21:18,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:21:18,689 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:18,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 04:21:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 04:21:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.829090909090909) internal successors, (503), 275 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 503 transitions. [2025-01-09 04:21:18,735 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 503 transitions. Word has length 77 [2025-01-09 04:21:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:18,736 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 503 transitions. [2025-01-09 04:21:18,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 503 transitions. [2025-01-09 04:21:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:21:18,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:18,738 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] [2025-01-09 04:21:18,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:21:18,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:18,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash -501531562, now seen corresponding path program 1 times [2025-01-09 04:21:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535325619] [2025-01-09 04:21:18,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:18,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:21:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:21:18,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:18,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:19,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:19,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535325619] [2025-01-09 04:21:19,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535325619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:19,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:19,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:21:19,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414799796] [2025-01-09 04:21:19,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:19,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:21:19,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:19,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:21:19,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:21:19,110 INFO L87 Difference]: Start difference. First operand 276 states and 503 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:19,225 INFO L93 Difference]: Finished difference Result 364 states and 656 transitions. [2025-01-09 04:21:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:21:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:21:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:19,230 INFO L225 Difference]: With dead ends: 364 [2025-01-09 04:21:19,230 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 04:21:19,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:21:19,232 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:19,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1957 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:21:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 04:21:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-01-09 04:21:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.6763636363636363) internal successors, (461), 275 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 461 transitions. [2025-01-09 04:21:19,248 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 461 transitions. Word has length 77 [2025-01-09 04:21:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:19,248 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 461 transitions. [2025-01-09 04:21:19,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 461 transitions. [2025-01-09 04:21:19,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 04:21:19,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:19,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:19,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:21:19,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:19,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:19,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1998269790, now seen corresponding path program 1 times [2025-01-09 04:21:19,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:19,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948024166] [2025-01-09 04:21:19,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:19,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:19,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 04:21:19,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 04:21:19,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:19,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:19,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:19,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948024166] [2025-01-09 04:21:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948024166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:19,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:19,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373564686] [2025-01-09 04:21:19,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:19,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:19,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:19,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:19,458 INFO L87 Difference]: Start difference. First operand 276 states and 461 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:19,513 INFO L93 Difference]: Finished difference Result 433 states and 738 transitions. [2025-01-09 04:21:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-01-09 04:21:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:19,516 INFO L225 Difference]: With dead ends: 433 [2025-01-09 04:21:19,516 INFO L226 Difference]: Without dead ends: 349 [2025-01-09 04:21:19,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:19,518 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 120 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:19,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 870 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-09 04:21:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2025-01-09 04:21:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.6849710982658959) internal successors, (583), 346 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 583 transitions. [2025-01-09 04:21:19,532 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 583 transitions. Word has length 118 [2025-01-09 04:21:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 583 transitions. [2025-01-09 04:21:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 583 transitions. [2025-01-09 04:21:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 04:21:19,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:19,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:19,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:21:19,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:19,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2075942872, now seen corresponding path program 1 times [2025-01-09 04:21:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:19,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846370178] [2025-01-09 04:21:19,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 04:21:19,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 04:21:19,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:19,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:19,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846370178] [2025-01-09 04:21:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846370178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:19,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:19,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:19,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765061580] [2025-01-09 04:21:19,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:19,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:19,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:19,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:19,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:19,731 INFO L87 Difference]: Start difference. First operand 347 states and 583 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:19,777 INFO L93 Difference]: Finished difference Result 639 states and 1091 transitions. [2025-01-09 04:21:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:19,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-01-09 04:21:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:19,780 INFO L225 Difference]: With dead ends: 639 [2025-01-09 04:21:19,780 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 04:21:19,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:19,781 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 121 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:19,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 970 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 04:21:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2025-01-09 04:21:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.6985446985446986) internal successors, (817), 481 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 817 transitions. [2025-01-09 04:21:19,807 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 817 transitions. Word has length 121 [2025-01-09 04:21:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:19,807 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 817 transitions. [2025-01-09 04:21:19,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 817 transitions. [2025-01-09 04:21:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:21:19,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:19,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:19,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:21:19,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:19,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -909344921, now seen corresponding path program 1 times [2025-01-09 04:21:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:19,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658320663] [2025-01-09 04:21:19,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:19,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:21:19,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:21:19,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:19,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658320663] [2025-01-09 04:21:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658320663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:19,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:19,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:19,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027330138] [2025-01-09 04:21:19,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:19,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:19,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:19,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:19,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:19,984 INFO L87 Difference]: Start difference. First operand 482 states and 817 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:20,041 INFO L93 Difference]: Finished difference Result 784 states and 1341 transitions. [2025-01-09 04:21:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:20,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:21:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:20,045 INFO L225 Difference]: With dead ends: 784 [2025-01-09 04:21:20,046 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 04:21:20,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,049 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 122 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:20,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 992 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 04:21:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2025-01-09 04:21:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 1.7012779552715656) internal successors, (1065), 626 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1065 transitions. [2025-01-09 04:21:20,071 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1065 transitions. Word has length 124 [2025-01-09 04:21:20,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:20,071 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 1065 transitions. [2025-01-09 04:21:20,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1065 transitions. [2025-01-09 04:21:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 04:21:20,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:20,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:20,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:21:20,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:20,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1162491390, now seen corresponding path program 1 times [2025-01-09 04:21:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654813538] [2025-01-09 04:21:20,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:20,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 04:21:20,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 04:21:20,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:20,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654813538] [2025-01-09 04:21:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654813538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:20,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:20,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527932512] [2025-01-09 04:21:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:20,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:20,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:20,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,233 INFO L87 Difference]: Start difference. First operand 627 states and 1065 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:20,263 INFO L93 Difference]: Finished difference Result 1403 states and 2405 transitions. [2025-01-09 04:21:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2025-01-09 04:21:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:20,268 INFO L225 Difference]: With dead ends: 1403 [2025-01-09 04:21:20,268 INFO L226 Difference]: Without dead ends: 988 [2025-01-09 04:21:20,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,270 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 114 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:20,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 961 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-01-09 04:21:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2025-01-09 04:21:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 1.7025380710659899) internal successors, (1677), 985 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1677 transitions. [2025-01-09 04:21:20,301 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1677 transitions. Word has length 124 [2025-01-09 04:21:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:20,302 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1677 transitions. [2025-01-09 04:21:20,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1677 transitions. [2025-01-09 04:21:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 04:21:20,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:20,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:20,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:21:20,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -114537757, now seen corresponding path program 1 times [2025-01-09 04:21:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:20,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226318928] [2025-01-09 04:21:20,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:20,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:21:20,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:21:20,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:20,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226318928] [2025-01-09 04:21:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226318928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:20,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200286295] [2025-01-09 04:21:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:20,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:20,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:20,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,414 INFO L87 Difference]: Start difference. First operand 986 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:20,446 INFO L93 Difference]: Finished difference Result 1746 states and 2985 transitions. [2025-01-09 04:21:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 04:21:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:20,452 INFO L225 Difference]: With dead ends: 1746 [2025-01-09 04:21:20,452 INFO L226 Difference]: Without dead ends: 1331 [2025-01-09 04:21:20,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,454 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 115 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:20,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 982 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2025-01-09 04:21:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1329. [2025-01-09 04:21:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1328 states have (on average 1.6980421686746987) internal successors, (2255), 1328 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 2255 transitions. [2025-01-09 04:21:20,483 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 2255 transitions. Word has length 127 [2025-01-09 04:21:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:20,483 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 2255 transitions. [2025-01-09 04:21:20,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2255 transitions. [2025-01-09 04:21:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 04:21:20,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:20,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:21:20,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:20,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1950541050, now seen corresponding path program 1 times [2025-01-09 04:21:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538277381] [2025-01-09 04:21:20,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:20,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:21:20,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:21:20,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:20,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:20,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538277381] [2025-01-09 04:21:20,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538277381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:20,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:20,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:20,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268219118] [2025-01-09 04:21:20,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:20,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:20,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:20,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,609 INFO L87 Difference]: Start difference. First operand 1329 states and 2255 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:20,651 INFO L93 Difference]: Finished difference Result 3373 states and 5731 transitions. [2025-01-09 04:21:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 04:21:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:20,659 INFO L225 Difference]: With dead ends: 3373 [2025-01-09 04:21:20,660 INFO L226 Difference]: Without dead ends: 2270 [2025-01-09 04:21:20,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,663 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 107 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:20,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 952 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2025-01-09 04:21:20,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2025-01-09 04:21:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2268 states, 2267 states have (on average 1.6854874283193648) internal successors, (3821), 2267 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 3821 transitions. [2025-01-09 04:21:20,740 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 3821 transitions. Word has length 127 [2025-01-09 04:21:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:20,740 INFO L471 AbstractCegarLoop]: Abstraction has 2268 states and 3821 transitions. [2025-01-09 04:21:20,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 3821 transitions. [2025-01-09 04:21:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 04:21:20,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:20,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:20,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:21:20,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:20,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1946384695, now seen corresponding path program 1 times [2025-01-09 04:21:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106918029] [2025-01-09 04:21:20,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:20,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 04:21:20,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 04:21:20,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:20,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:20,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106918029] [2025-01-09 04:21:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106918029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486112750] [2025-01-09 04:21:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:20,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:20,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:20,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,844 INFO L87 Difference]: Start difference. First operand 2268 states and 3821 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:20,887 INFO L93 Difference]: Finished difference Result 4236 states and 7157 transitions. [2025-01-09 04:21:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-01-09 04:21:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:20,897 INFO L225 Difference]: With dead ends: 4236 [2025-01-09 04:21:20,897 INFO L226 Difference]: Without dead ends: 3133 [2025-01-09 04:21:20,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:20,900 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 108 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:20,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 972 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2025-01-09 04:21:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3131. [2025-01-09 04:21:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 3130 states have (on average 1.6757188498402555) internal successors, (5245), 3130 states have internal predecessors, (5245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 5245 transitions. [2025-01-09 04:21:20,964 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 5245 transitions. Word has length 130 [2025-01-09 04:21:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 3131 states and 5245 transitions. [2025-01-09 04:21:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 5245 transitions. [2025-01-09 04:21:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 04:21:20,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:20,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:20,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:21:20,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:20,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash 708617886, now seen corresponding path program 1 times [2025-01-09 04:21:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481491870] [2025-01-09 04:21:20,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:21,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 04:21:21,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 04:21:21,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:21,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:21,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481491870] [2025-01-09 04:21:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481491870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:21,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:21,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:21:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319546750] [2025-01-09 04:21:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:21,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:21:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:21,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:21:21,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:21:21,155 INFO L87 Difference]: Start difference. First operand 3131 states and 5245 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:21,520 INFO L93 Difference]: Finished difference Result 18773 states and 31898 transitions. [2025-01-09 04:21:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:21:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2025-01-09 04:21:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:21,575 INFO L225 Difference]: With dead ends: 18773 [2025-01-09 04:21:21,576 INFO L226 Difference]: Without dead ends: 15882 [2025-01-09 04:21:21,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:21:21,586 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1476 mSDsluCounter, 2882 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:21,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 3389 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:21:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15882 states. [2025-01-09 04:21:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15882 to 5889. [2025-01-09 04:21:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5889 states, 5888 states have (on average 1.6727241847826086) internal successors, (9849), 5888 states have internal predecessors, (9849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5889 states to 5889 states and 9849 transitions. [2025-01-09 04:21:21,833 INFO L78 Accepts]: Start accepts. Automaton has 5889 states and 9849 transitions. Word has length 130 [2025-01-09 04:21:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:21,833 INFO L471 AbstractCegarLoop]: Abstraction has 5889 states and 9849 transitions. [2025-01-09 04:21:21,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:21,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5889 states and 9849 transitions. [2025-01-09 04:21:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:21:21,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:21,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:21:21,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:21,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1602288768, now seen corresponding path program 1 times [2025-01-09 04:21:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406268844] [2025-01-09 04:21:21,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:21,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:21:21,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:21:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406268844] [2025-01-09 04:21:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406268844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:21:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990202567] [2025-01-09 04:21:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:21,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:21:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:21:21,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:21:21,947 INFO L87 Difference]: Start difference. First operand 5889 states and 9849 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:22,134 INFO L93 Difference]: Finished difference Result 17804 states and 30144 transitions. [2025-01-09 04:21:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:21:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:21:22,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:22,155 INFO L225 Difference]: With dead ends: 17804 [2025-01-09 04:21:22,155 INFO L226 Difference]: Without dead ends: 12172 [2025-01-09 04:21:22,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:21:22,162 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 363 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:22,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1575 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12172 states. [2025-01-09 04:21:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12172 to 8984. [2025-01-09 04:21:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8984 states, 8983 states have (on average 1.6780585550484248) internal successors, (15074), 8983 states have internal predecessors, (15074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8984 states to 8984 states and 15074 transitions. [2025-01-09 04:21:22,358 INFO L78 Accepts]: Start accepts. Automaton has 8984 states and 15074 transitions. Word has length 131 [2025-01-09 04:21:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:22,358 INFO L471 AbstractCegarLoop]: Abstraction has 8984 states and 15074 transitions. [2025-01-09 04:21:22,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8984 states and 15074 transitions. [2025-01-09 04:21:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 04:21:22,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:22,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:22,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:21:22,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:22,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash -344737802, now seen corresponding path program 1 times [2025-01-09 04:21:22,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050175402] [2025-01-09 04:21:22,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:22,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 04:21:22,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 04:21:22,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:22,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:22,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050175402] [2025-01-09 04:21:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050175402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:22,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675124049] [2025-01-09 04:21:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:22,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:22,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:22,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:22,493 INFO L87 Difference]: Start difference. First operand 8984 states and 15074 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:22,640 INFO L93 Difference]: Finished difference Result 20071 states and 33926 transitions. [2025-01-09 04:21:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-01-09 04:21:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:22,666 INFO L225 Difference]: With dead ends: 20071 [2025-01-09 04:21:22,666 INFO L226 Difference]: Without dead ends: 13746 [2025-01-09 04:21:22,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:22,678 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 129 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:22,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1010 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13746 states. [2025-01-09 04:21:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13746 to 13744. [2025-01-09 04:21:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13744 states, 13743 states have (on average 1.6712508185985593) internal successors, (22968), 13743 states have internal predecessors, (22968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13744 states to 13744 states and 22968 transitions. [2025-01-09 04:21:23,046 INFO L78 Accepts]: Start accepts. Automaton has 13744 states and 22968 transitions. Word has length 131 [2025-01-09 04:21:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:23,047 INFO L471 AbstractCegarLoop]: Abstraction has 13744 states and 22968 transitions. [2025-01-09 04:21:23,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 13744 states and 22968 transitions. [2025-01-09 04:21:23,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 04:21:23,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:23,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:23,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:21:23,049 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:23,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:23,049 INFO L85 PathProgramCache]: Analyzing trace with hash -56946667, now seen corresponding path program 1 times [2025-01-09 04:21:23,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:23,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099661091] [2025-01-09 04:21:23,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:23,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:23,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 04:21:23,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 04:21:23,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:23,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:23,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:23,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099661091] [2025-01-09 04:21:23,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099661091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:23,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:23,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:21:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068633045] [2025-01-09 04:21:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:23,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:21:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:23,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:21:23,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:21:23,190 INFO L87 Difference]: Start difference. First operand 13744 states and 22968 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:23,611 INFO L93 Difference]: Finished difference Result 45169 states and 75660 transitions. [2025-01-09 04:21:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:21:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-01-09 04:21:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:23,674 INFO L225 Difference]: With dead ends: 45169 [2025-01-09 04:21:23,674 INFO L226 Difference]: Without dead ends: 31640 [2025-01-09 04:21:23,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:21:23,691 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 421 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:23,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1453 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31640 states. [2025-01-09 04:21:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31640 to 22603. [2025-01-09 04:21:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22603 states, 22602 states have (on average 1.662065303955402) internal successors, (37566), 22602 states have internal predecessors, (37566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22603 states to 22603 states and 37566 transitions. [2025-01-09 04:21:24,264 INFO L78 Accepts]: Start accepts. Automaton has 22603 states and 37566 transitions. Word has length 132 [2025-01-09 04:21:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:24,264 INFO L471 AbstractCegarLoop]: Abstraction has 22603 states and 37566 transitions. [2025-01-09 04:21:24,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 22603 states and 37566 transitions. [2025-01-09 04:21:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 04:21:24,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:24,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:24,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:21:24,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:24,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:24,266 INFO L85 PathProgramCache]: Analyzing trace with hash 773022551, now seen corresponding path program 1 times [2025-01-09 04:21:24,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:24,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435391773] [2025-01-09 04:21:24,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:24,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:24,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 04:21:24,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 04:21:24,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:24,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:24,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:24,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435391773] [2025-01-09 04:21:24,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435391773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:24,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:24,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:21:24,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493404922] [2025-01-09 04:21:24,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:24,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:21:24,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:24,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:21:24,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:21:24,398 INFO L87 Difference]: Start difference. First operand 22603 states and 37566 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:25,131 INFO L93 Difference]: Finished difference Result 74067 states and 123372 transitions. [2025-01-09 04:21:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:21:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-01-09 04:21:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:25,227 INFO L225 Difference]: With dead ends: 74067 [2025-01-09 04:21:25,227 INFO L226 Difference]: Without dead ends: 51679 [2025-01-09 04:21:25,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:21:25,251 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 419 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:25,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1455 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:21:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51679 states. [2025-01-09 04:21:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51679 to 36998. [2025-01-09 04:21:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36998 states, 36997 states have (on average 1.6528907749276969) internal successors, (61152), 36997 states have internal predecessors, (61152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36998 states to 36998 states and 61152 transitions. [2025-01-09 04:21:26,178 INFO L78 Accepts]: Start accepts. Automaton has 36998 states and 61152 transitions. Word has length 133 [2025-01-09 04:21:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:26,178 INFO L471 AbstractCegarLoop]: Abstraction has 36998 states and 61152 transitions. [2025-01-09 04:21:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 36998 states and 61152 transitions. [2025-01-09 04:21:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 04:21:26,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:26,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:21:26,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 901268876, now seen corresponding path program 1 times [2025-01-09 04:21:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639155001] [2025-01-09 04:21:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:26,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 04:21:26,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 04:21:26,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:26,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639155001] [2025-01-09 04:21:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639155001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:26,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:26,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:21:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637468559] [2025-01-09 04:21:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:21:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:26,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:21:26,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:21:26,403 INFO L87 Difference]: Start difference. First operand 36998 states and 61152 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:27,123 INFO L93 Difference]: Finished difference Result 119893 states and 198604 transitions. [2025-01-09 04:21:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:21:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2025-01-09 04:21:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:27,281 INFO L225 Difference]: With dead ends: 119893 [2025-01-09 04:21:27,281 INFO L226 Difference]: Without dead ends: 83110 [2025-01-09 04:21:27,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:21:27,321 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 417 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:27,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1441 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83110 states. [2025-01-09 04:21:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83110 to 59829. [2025-01-09 04:21:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59829 states, 59828 states have (on average 1.6440128367988234) internal successors, (98358), 59828 states have internal predecessors, (98358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59829 states to 59829 states and 98358 transitions. [2025-01-09 04:21:28,732 INFO L78 Accepts]: Start accepts. Automaton has 59829 states and 98358 transitions. Word has length 134 [2025-01-09 04:21:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:28,733 INFO L471 AbstractCegarLoop]: Abstraction has 59829 states and 98358 transitions. [2025-01-09 04:21:28,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 59829 states and 98358 transitions. [2025-01-09 04:21:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 04:21:28,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:28,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:28,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:21:28,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 614809284, now seen corresponding path program 1 times [2025-01-09 04:21:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918420081] [2025-01-09 04:21:28,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:28,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 04:21:28,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 04:21:28,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:28,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:29,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:29,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918420081] [2025-01-09 04:21:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918420081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:29,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:29,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:21:29,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572135408] [2025-01-09 04:21:29,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:29,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:21:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:29,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:21:29,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:21:29,183 INFO L87 Difference]: Start difference. First operand 59829 states and 98358 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:29,942 INFO L93 Difference]: Finished difference Result 119445 states and 196373 transitions. [2025-01-09 04:21:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:21:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-01-09 04:21:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:30,068 INFO L225 Difference]: With dead ends: 119445 [2025-01-09 04:21:30,068 INFO L226 Difference]: Without dead ends: 59831 [2025-01-09 04:21:30,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:21:30,106 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 217 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:30,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 1729 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:21:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59831 states. [2025-01-09 04:21:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59831 to 59829. [2025-01-09 04:21:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59829 states, 59828 states have (on average 1.6335662231730963) internal successors, (97733), 59828 states have internal predecessors, (97733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59829 states to 59829 states and 97733 transitions. [2025-01-09 04:21:31,182 INFO L78 Accepts]: Start accepts. Automaton has 59829 states and 97733 transitions. Word has length 136 [2025-01-09 04:21:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 59829 states and 97733 transitions. [2025-01-09 04:21:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59829 states and 97733 transitions. [2025-01-09 04:21:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 04:21:31,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:31,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:31,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:21:31,185 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:31,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 995393594, now seen corresponding path program 1 times [2025-01-09 04:21:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823366393] [2025-01-09 04:21:31,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:31,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 04:21:31,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 04:21:31,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:31,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823366393] [2025-01-09 04:21:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823366393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:21:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191402200] [2025-01-09 04:21:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:21:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:31,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:21:31,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:21:31,635 INFO L87 Difference]: Start difference. First operand 59829 states and 97733 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:32,589 INFO L93 Difference]: Finished difference Result 174963 states and 286257 transitions. [2025-01-09 04:21:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:21:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-01-09 04:21:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:32,831 INFO L225 Difference]: With dead ends: 174963 [2025-01-09 04:21:32,832 INFO L226 Difference]: Without dead ends: 115349 [2025-01-09 04:21:32,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:21:32,908 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 423 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:32,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1742 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:21:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115349 states. [2025-01-09 04:21:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115349 to 115347. [2025-01-09 04:21:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115347 states, 115346 states have (on average 1.6199087961437761) internal successors, (186850), 115346 states have internal predecessors, (186850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115347 states to 115347 states and 186850 transitions. [2025-01-09 04:21:35,237 INFO L78 Accepts]: Start accepts. Automaton has 115347 states and 186850 transitions. Word has length 139 [2025-01-09 04:21:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:35,238 INFO L471 AbstractCegarLoop]: Abstraction has 115347 states and 186850 transitions. [2025-01-09 04:21:35,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 115347 states and 186850 transitions. [2025-01-09 04:21:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 04:21:35,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:35,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:21:35,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:21:35,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:35,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash 361084909, now seen corresponding path program 1 times [2025-01-09 04:21:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:35,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191850498] [2025-01-09 04:21:35,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:35,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 04:21:35,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 04:21:35,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:21:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191850498] [2025-01-09 04:21:35,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191850498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:35,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:35,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:21:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758066688] [2025-01-09 04:21:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:35,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:21:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:35,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:21:35,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:21:35,819 INFO L87 Difference]: Start difference. First operand 115347 states and 186850 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:36,580 INFO L93 Difference]: Finished difference Result 121157 states and 194595 transitions. [2025-01-09 04:21:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:21:36,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2025-01-09 04:21:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:36,760 INFO L225 Difference]: With dead ends: 121157 [2025-01-09 04:21:36,760 INFO L226 Difference]: Without dead ends: 121155 [2025-01-09 04:21:36,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:21:36,795 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 0 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:36,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3166 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121155 states. [2025-01-09 04:21:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121155 to 121155. [2025-01-09 04:21:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121155 states, 121154 states have (on average 1.5899681397229972) internal successors, (192631), 121154 states have internal predecessors, (192631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121155 states to 121155 states and 192631 transitions. [2025-01-09 04:21:39,268 INFO L78 Accepts]: Start accepts. Automaton has 121155 states and 192631 transitions. Word has length 140 [2025-01-09 04:21:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:39,270 INFO L471 AbstractCegarLoop]: Abstraction has 121155 states and 192631 transitions. [2025-01-09 04:21:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 121155 states and 192631 transitions. [2025-01-09 04:21:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 04:21:39,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:39,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:21:39,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:21:39,285 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:39,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 296544413, now seen corresponding path program 1 times [2025-01-09 04:21:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050575] [2025-01-09 04:21:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:39,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 04:21:39,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 04:21:39,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:39,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:21:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050575] [2025-01-09 04:21:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:39,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:39,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:39,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511687291] [2025-01-09 04:21:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:39,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:39,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:39,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:39,370 INFO L87 Difference]: Start difference. First operand 121155 states and 192631 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:41,689 INFO L93 Difference]: Finished difference Result 362432 states and 575848 transitions. [2025-01-09 04:21:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-01-09 04:21:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:42,049 INFO L225 Difference]: With dead ends: 362432 [2025-01-09 04:21:42,049 INFO L226 Difference]: Without dead ends: 241342 [2025-01-09 04:21:42,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:42,122 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 319 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:42,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1142 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241342 states. [2025-01-09 04:21:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241342 to 241340. [2025-01-09 04:21:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241340 states, 241339 states have (on average 1.578994692113583) internal successors, (381073), 241339 states have internal predecessors, (381073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241340 states to 241340 states and 381073 transitions. [2025-01-09 04:21:46,516 INFO L78 Accepts]: Start accepts. Automaton has 241340 states and 381073 transitions. Word has length 175 [2025-01-09 04:21:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:21:46,517 INFO L471 AbstractCegarLoop]: Abstraction has 241340 states and 381073 transitions. [2025-01-09 04:21:46,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 241340 states and 381073 transitions. [2025-01-09 04:21:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 04:21:46,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:21:46,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 04:21:46,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:21:46,539 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:21:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:21:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2068310566, now seen corresponding path program 1 times [2025-01-09 04:21:46,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:21:46,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430462343] [2025-01-09 04:21:46,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:21:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:21:46,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 04:21:46,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 04:21:46,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:21:46,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:21:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:21:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:21:46,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430462343] [2025-01-09 04:21:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430462343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:21:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:21:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:21:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668968342] [2025-01-09 04:21:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:21:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:21:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:21:46,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:21:46,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:46,626 INFO L87 Difference]: Start difference. First operand 241340 states and 381073 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:21:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:21:51,379 INFO L93 Difference]: Finished difference Result 722072 states and 1139344 transitions. [2025-01-09 04:21:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:21:51,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-01-09 04:21:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:21:52,475 INFO L225 Difference]: With dead ends: 722072 [2025-01-09 04:21:52,476 INFO L226 Difference]: Without dead ends: 480829 [2025-01-09 04:21:52,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:21:52,635 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 384 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:21:52,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1215 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:21:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480829 states.