./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 33de5d7f20015c0808aeb1de8a96a544518a9ee4634466bd76c0c961f4a657cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:24:30,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:24:30,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:24:30,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:24:30,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:24:30,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:24:30,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:24:30,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:24:30,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:24:30,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:24:30,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:24:30,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:24:30,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:24:30,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:24:30,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:24:30,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:24:30,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:24:30,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:24:30,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:24:30,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:24:30,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:24:30,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:24:30,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:24:30,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:24:30,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:24:30,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:24:30,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:24:30,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:24:30,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:24:30,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:24:30,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:24:30,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:24:30,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:24:30,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:24:30,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:24:30,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:24:30,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:24:30,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:24:30,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:24:30,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:24:30,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:24:30,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:24:30,384 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33de5d7f20015c0808aeb1de8a96a544518a9ee4634466bd76c0c961f4a657cf [2024-11-09 19:24:30,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:24:30,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:24:30,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:24:30,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:24:30,596 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:24:30,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label04.c [2024-11-09 19:24:31,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:24:32,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:24:32,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label04.c [2024-11-09 19:24:32,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a73ba1e8/3241603a95d8462f8fa59a94979c8244/FLAG08b11fd36 [2024-11-09 19:24:32,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a73ba1e8/3241603a95d8462f8fa59a94979c8244 [2024-11-09 19:24:32,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:24:32,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:24:32,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:24:32,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:24:32,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:24:32,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:24:32" (1/1) ... [2024-11-09 19:24:32,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773e47eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:32, skipping insertion in model container [2024-11-09 19:24:32,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:24:32" (1/1) ... [2024-11-09 19:24:32,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:24:32,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label04.c[7422,7435] [2024-11-09 19:24:32,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:24:32,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:24:33,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label04.c[7422,7435] [2024-11-09 19:24:33,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:24:33,314 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:24:33,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33 WrapperNode [2024-11-09 19:24:33,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:24:33,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:24:33,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:24:33,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:24:33,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,580 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:24:33,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:24:33,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:24:33,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:24:33,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:24:33,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,792 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]. [2024-11-09 19:24:33,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:24:33,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:24:33,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:24:33,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:24:33,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (1/1) ... [2024-11-09 19:24:33,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:24:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:24:33,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:24:33,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:24:34,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:24:34,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:24:34,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:24:34,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:24:34,055 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:24:34,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:24:37,890 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:24:37,891 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:24:37,891 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:24:38,153 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:24:38,154 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:24:38,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:24:38,189 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:24:38,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:24:38 BoogieIcfgContainer [2024-11-09 19:24:38,190 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:24:38,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:24:38,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:24:38,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:24:38,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:24:32" (1/3) ... [2024-11-09 19:24:38,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8d829f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:24:38, skipping insertion in model container [2024-11-09 19:24:38,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:24:33" (2/3) ... [2024-11-09 19:24:38,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8d829f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:24:38, skipping insertion in model container [2024-11-09 19:24:38,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:24:38" (3/3) ... [2024-11-09 19:24:38,199 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label04.c [2024-11-09 19:24:38,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:24:38,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:24:38,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:24:38,296 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;@6935dcf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:24:38,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:24:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 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) [2024-11-09 19:24:38,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 19:24:38,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:38,313 INFO L215 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] [2024-11-09 19:24:38,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:38,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 296330215, now seen corresponding path program 1 times [2024-11-09 19:24:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:38,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072790504] [2024-11-09 19:24:38,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:38,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072790504] [2024-11-09 19:24:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072790504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334512181] [2024-11-09 19:24:38,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:38,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:38,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:38,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:38,805 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 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 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-09 19:24:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:45,199 INFO L93 Difference]: Finished difference Result 3150 states and 8858 transitions. [2024-11-09 19:24:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:45,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2024-11-09 19:24:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:45,229 INFO L225 Difference]: With dead ends: 3150 [2024-11-09 19:24:45,229 INFO L226 Difference]: Without dead ends: 2261 [2024-11-09 19:24:45,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:24:45,235 INFO L432 NwaCegarLoop]: 757 mSDtfsCounter, 4251 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8031 mSolverCounterSat, 1364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 9395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1364 IncrementalHoareTripleChecker+Valid, 8031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:45,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 789 Invalid, 9395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1364 Valid, 8031 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-09 19:24:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-09 19:24:45,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2024-11-09 19:24:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 2.4154867256637167) internal successors, (5459), 2260 states have internal predecessors, (5459), 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) [2024-11-09 19:24:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5459 transitions. [2024-11-09 19:24:45,340 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5459 transitions. Word has length 62 [2024-11-09 19:24:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:45,342 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5459 transitions. [2024-11-09 19:24:45,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-09 19:24:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5459 transitions. [2024-11-09 19:24:45,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 19:24:45,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:45,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:24:45,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1258311237, now seen corresponding path program 1 times [2024-11-09 19:24:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:45,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022819563] [2024-11-09 19:24:45,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022819563] [2024-11-09 19:24:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022819563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330068695] [2024-11-09 19:24:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:45,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:45,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:45,631 INFO L87 Difference]: Start difference. First operand 2261 states and 5459 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 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) [2024-11-09 19:24:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:49,828 INFO L93 Difference]: Finished difference Result 6062 states and 14971 transitions. [2024-11-09 19:24:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 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 [2024-11-09 19:24:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:49,841 INFO L225 Difference]: With dead ends: 6062 [2024-11-09 19:24:49,841 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:24:49,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:49,845 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 1368 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5844 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 6508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 5844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:49,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 718 Invalid, 6508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 5844 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:24:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:24:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:24:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.233262486716259) internal successors, (8406), 3764 states have internal predecessors, (8406), 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) [2024-11-09 19:24:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8406 transitions. [2024-11-09 19:24:49,913 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8406 transitions. Word has length 134 [2024-11-09 19:24:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:49,915 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8406 transitions. [2024-11-09 19:24:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 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) [2024-11-09 19:24:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8406 transitions. [2024-11-09 19:24:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-09 19:24:49,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:49,920 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:24:49,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:24:49,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:49,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -37030639, now seen corresponding path program 1 times [2024-11-09 19:24:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141745579] [2024-11-09 19:24:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:24:50,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:50,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141745579] [2024-11-09 19:24:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141745579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:50,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819834460] [2024-11-09 19:24:50,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:50,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:24:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:50,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:24:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:50,356 INFO L87 Difference]: Start difference. First operand 3765 states and 8406 transitions. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 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) [2024-11-09 19:24:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:53,813 INFO L93 Difference]: Finished difference Result 9073 states and 20800 transitions. [2024-11-09 19:24:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:24:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 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 276 [2024-11-09 19:24:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:53,829 INFO L225 Difference]: With dead ends: 9073 [2024-11-09 19:24:53,832 INFO L226 Difference]: Without dead ends: 5272 [2024-11-09 19:24:53,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:24:53,839 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1531 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5448 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 6001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 5448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:53,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 331 Invalid, 6001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 5448 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:24:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2024-11-09 19:24:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5269. [2024-11-09 19:24:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 5268 states have (on average 2.2272209567198176) internal successors, (11733), 5268 states have internal predecessors, (11733), 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) [2024-11-09 19:24:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 11733 transitions. [2024-11-09 19:24:53,906 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 11733 transitions. Word has length 276 [2024-11-09 19:24:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:53,909 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 11733 transitions. [2024-11-09 19:24:53,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 3 states have internal predecessors, (206), 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) [2024-11-09 19:24:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 11733 transitions. [2024-11-09 19:24:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-09 19:24:53,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:53,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:53,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:24:53,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:53,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:53,913 INFO L85 PathProgramCache]: Analyzing trace with hash 821221415, now seen corresponding path program 1 times [2024-11-09 19:24:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814600021] [2024-11-09 19:24:53,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:53,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:24:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:54,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814600021] [2024-11-09 19:24:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814600021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:54,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452629508] [2024-11-09 19:24:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:54,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:54,086 INFO L87 Difference]: Start difference. First operand 5269 states and 11733 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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) [2024-11-09 19:24:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:24:57,074 INFO L93 Difference]: Finished difference Result 15048 states and 33756 transitions. [2024-11-09 19:24:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:24:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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 290 [2024-11-09 19:24:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:24:57,101 INFO L225 Difference]: With dead ends: 15048 [2024-11-09 19:24:57,101 INFO L226 Difference]: Without dead ends: 9781 [2024-11-09 19:24:57,106 INFO L431 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 [2024-11-09 19:24:57,107 INFO L432 NwaCegarLoop]: 1936 mSDtfsCounter, 1357 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 4378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:24:57,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 1944 Invalid, 4378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:24:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9781 states. [2024-11-09 19:24:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9781 to 9781. [2024-11-09 19:24:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9781 states, 9780 states have (on average 2.201124744376278) internal successors, (21527), 9780 states have internal predecessors, (21527), 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) [2024-11-09 19:24:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9781 states to 9781 states and 21527 transitions. [2024-11-09 19:24:57,233 INFO L78 Accepts]: Start accepts. Automaton has 9781 states and 21527 transitions. Word has length 290 [2024-11-09 19:24:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:24:57,234 INFO L471 AbstractCegarLoop]: Abstraction has 9781 states and 21527 transitions. [2024-11-09 19:24:57,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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) [2024-11-09 19:24:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9781 states and 21527 transitions. [2024-11-09 19:24:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-11-09 19:24:57,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:24:57,237 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:24:57,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:24:57,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:24:57,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:24:57,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2070502555, now seen corresponding path program 1 times [2024-11-09 19:24:57,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:24:57,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802861133] [2024-11-09 19:24:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:24:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:24:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:24:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-09 19:24:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:24:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802861133] [2024-11-09 19:24:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802861133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:24:57,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:24:57,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:24:57,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192950406] [2024-11-09 19:24:57,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:24:57,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:24:57,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:24:57,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:24:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:24:57,420 INFO L87 Difference]: Start difference. First operand 9781 states and 21527 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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) [2024-11-09 19:25:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:00,608 INFO L93 Difference]: Finished difference Result 24072 states and 53344 transitions. [2024-11-09 19:25:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 294 [2024-11-09 19:25:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:00,636 INFO L225 Difference]: With dead ends: 24072 [2024-11-09 19:25:00,636 INFO L226 Difference]: Without dead ends: 14293 [2024-11-09 19:25:00,646 INFO L431 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 [2024-11-09 19:25:00,648 INFO L432 NwaCegarLoop]: 1974 mSDtfsCounter, 1360 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3815 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 3815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:00,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1984 Invalid, 4313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 3815 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:25:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14293 states. [2024-11-09 19:25:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14293 to 14293. [2024-11-09 19:25:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14293 states, 14292 states have (on average 2.1890568150013996) internal successors, (31286), 14292 states have internal predecessors, (31286), 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) [2024-11-09 19:25:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14293 states to 14293 states and 31286 transitions. [2024-11-09 19:25:00,817 INFO L78 Accepts]: Start accepts. Automaton has 14293 states and 31286 transitions. Word has length 294 [2024-11-09 19:25:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:00,817 INFO L471 AbstractCegarLoop]: Abstraction has 14293 states and 31286 transitions. [2024-11-09 19:25:00,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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) [2024-11-09 19:25:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 14293 states and 31286 transitions. [2024-11-09 19:25:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-09 19:25:00,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:00,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:25:00,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:25:00,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:00,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -330100137, now seen corresponding path program 1 times [2024-11-09 19:25:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:00,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988722847] [2024-11-09 19:25:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 19:25:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988722847] [2024-11-09 19:25:01,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988722847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648160593] [2024-11-09 19:25:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:01,102 INFO L87 Difference]: Start difference. First operand 14293 states and 31286 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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) [2024-11-09 19:25:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:04,197 INFO L93 Difference]: Finished difference Result 39112 states and 86432 transitions. [2024-11-09 19:25:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 295 [2024-11-09 19:25:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:04,238 INFO L225 Difference]: With dead ends: 39112 [2024-11-09 19:25:04,239 INFO L226 Difference]: Without dead ends: 24821 [2024-11-09 19:25:04,253 INFO L431 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 [2024-11-09 19:25:04,256 INFO L432 NwaCegarLoop]: 1970 mSDtfsCounter, 1383 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 4195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:04,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1980 Invalid, 4195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:25:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24821 states. [2024-11-09 19:25:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24821 to 24821. [2024-11-09 19:25:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24821 states, 24820 states have (on average 2.1125302175664786) internal successors, (52433), 24820 states have internal predecessors, (52433), 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) [2024-11-09 19:25:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24821 states to 24821 states and 52433 transitions. [2024-11-09 19:25:04,579 INFO L78 Accepts]: Start accepts. Automaton has 24821 states and 52433 transitions. Word has length 295 [2024-11-09 19:25:04,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:04,579 INFO L471 AbstractCegarLoop]: Abstraction has 24821 states and 52433 transitions. [2024-11-09 19:25:04,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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) [2024-11-09 19:25:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 24821 states and 52433 transitions. [2024-11-09 19:25:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-09 19:25:04,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:04,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:25:04,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:25:04,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:04,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:04,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1303924397, now seen corresponding path program 1 times [2024-11-09 19:25:04,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74950526] [2024-11-09 19:25:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 159 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:25:04,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74950526] [2024-11-09 19:25:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74950526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:25:04,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792516454] [2024-11-09 19:25:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:04,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:25:04,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:25:04,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:25:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:04,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:25:04,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:25:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-09 19:25:05,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:25:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792516454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:25:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-09 19:25:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176715397] [2024-11-09 19:25:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:05,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:25:05,206 INFO L87 Difference]: Start difference. First operand 24821 states and 52433 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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) [2024-11-09 19:25:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:08,148 INFO L93 Difference]: Finished difference Result 59416 states and 127226 transitions. [2024-11-09 19:25:08,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:08,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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 318 [2024-11-09 19:25:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:08,190 INFO L225 Difference]: With dead ends: 59416 [2024-11-09 19:25:08,191 INFO L226 Difference]: Without dead ends: 34597 [2024-11-09 19:25:08,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:25:08,212 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1370 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 834 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 4163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 834 IncrementalHoareTripleChecker+Valid, 3329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:08,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 435 Invalid, 4163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [834 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 19:25:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34597 states. [2024-11-09 19:25:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34597 to 33093. [2024-11-09 19:25:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33093 states, 33092 states have (on average 2.090172851444458) internal successors, (69168), 33092 states have internal predecessors, (69168), 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) [2024-11-09 19:25:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33093 states to 33093 states and 69168 transitions. [2024-11-09 19:25:08,747 INFO L78 Accepts]: Start accepts. Automaton has 33093 states and 69168 transitions. Word has length 318 [2024-11-09 19:25:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:08,749 INFO L471 AbstractCegarLoop]: Abstraction has 33093 states and 69168 transitions. [2024-11-09 19:25:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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) [2024-11-09 19:25:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33093 states and 69168 transitions. [2024-11-09 19:25:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-09 19:25:08,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:08,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:25:08,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:25:08,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:25:08,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:08,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 127760443, now seen corresponding path program 1 times [2024-11-09 19:25:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464046135] [2024-11-09 19:25:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 19:25:09,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:09,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464046135] [2024-11-09 19:25:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464046135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:09,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356106568] [2024-11-09 19:25:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:09,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:09,224 INFO L87 Difference]: Start difference. First operand 33093 states and 69168 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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) [2024-11-09 19:25:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:12,547 INFO L93 Difference]: Finished difference Result 77464 states and 163675 transitions. [2024-11-09 19:25:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:12,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 326 [2024-11-09 19:25:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:12,599 INFO L225 Difference]: With dead ends: 77464 [2024-11-09 19:25:12,599 INFO L226 Difference]: Without dead ends: 44373 [2024-11-09 19:25:12,612 INFO L431 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 [2024-11-09 19:25:12,612 INFO L432 NwaCegarLoop]: 1945 mSDtfsCounter, 1389 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3582 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 4113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 3582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:12,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1955 Invalid, 4113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 3582 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:25:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44373 states. [2024-11-09 19:25:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44373 to 44373. [2024-11-09 19:25:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44373 states, 44372 states have (on average 2.064274767871631) internal successors, (91596), 44372 states have internal predecessors, (91596), 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) [2024-11-09 19:25:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44373 states to 44373 states and 91596 transitions. [2024-11-09 19:25:13,085 INFO L78 Accepts]: Start accepts. Automaton has 44373 states and 91596 transitions. Word has length 326 [2024-11-09 19:25:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:13,086 INFO L471 AbstractCegarLoop]: Abstraction has 44373 states and 91596 transitions. [2024-11-09 19:25:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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) [2024-11-09 19:25:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44373 states and 91596 transitions. [2024-11-09 19:25:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-11-09 19:25:13,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:13,092 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-09 19:25:13,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:25:13,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:13,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:13,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1354394601, now seen corresponding path program 1 times [2024-11-09 19:25:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:13,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418450733] [2024-11-09 19:25:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-11-09 19:25:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418450733] [2024-11-09 19:25:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418450733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933285496] [2024-11-09 19:25:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:13,265 INFO L87 Difference]: Start difference. First operand 44373 states and 91596 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2024-11-09 19:25:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:16,612 INFO L93 Difference]: Finished difference Result 88744 states and 183190 transitions. [2024-11-09 19:25:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:16,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 441 [2024-11-09 19:25:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:16,671 INFO L225 Difference]: With dead ends: 88744 [2024-11-09 19:25:16,671 INFO L226 Difference]: Without dead ends: 44373 [2024-11-09 19:25:16,698 INFO L431 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 [2024-11-09 19:25:16,699 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1413 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3634 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 4302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 3634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:16,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 208 Invalid, 4302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 3634 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:25:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44373 states. [2024-11-09 19:25:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44373 to 42869. [2024-11-09 19:25:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42869 states, 42868 states have (on average 2.06146776150042) internal successors, (88371), 42868 states have internal predecessors, (88371), 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) [2024-11-09 19:25:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42869 states to 42869 states and 88371 transitions. [2024-11-09 19:25:17,223 INFO L78 Accepts]: Start accepts. Automaton has 42869 states and 88371 transitions. Word has length 441 [2024-11-09 19:25:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:17,223 INFO L471 AbstractCegarLoop]: Abstraction has 42869 states and 88371 transitions. [2024-11-09 19:25:17,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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) [2024-11-09 19:25:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 42869 states and 88371 transitions. [2024-11-09 19:25:17,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2024-11-09 19:25:17,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:17,229 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:25:17,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:25:17,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1030786635, now seen corresponding path program 1 times [2024-11-09 19:25:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:17,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417398417] [2024-11-09 19:25:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:17,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 19:25:17,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:17,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417398417] [2024-11-09 19:25:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417398417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:17,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:17,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739155119] [2024-11-09 19:25:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:17,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:17,586 INFO L87 Difference]: Start difference. First operand 42869 states and 88371 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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) [2024-11-09 19:25:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:20,996 INFO L93 Difference]: Finished difference Result 118072 states and 244564 transitions. [2024-11-09 19:25:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 452 [2024-11-09 19:25:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:21,093 INFO L225 Difference]: With dead ends: 118072 [2024-11-09 19:25:21,093 INFO L226 Difference]: Without dead ends: 75205 [2024-11-09 19:25:21,115 INFO L431 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 [2024-11-09 19:25:21,116 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 1381 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3645 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 4267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 3645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:21,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 553 Invalid, 4267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 3645 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:25:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75205 states. [2024-11-09 19:25:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75205 to 74453. [2024-11-09 19:25:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74453 states, 74452 states have (on average 2.0451163165529467) internal successors, (152263), 74452 states have internal predecessors, (152263), 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) [2024-11-09 19:25:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74453 states to 74453 states and 152263 transitions. [2024-11-09 19:25:22,002 INFO L78 Accepts]: Start accepts. Automaton has 74453 states and 152263 transitions. Word has length 452 [2024-11-09 19:25:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:22,002 INFO L471 AbstractCegarLoop]: Abstraction has 74453 states and 152263 transitions. [2024-11-09 19:25:22,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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) [2024-11-09 19:25:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 74453 states and 152263 transitions. [2024-11-09 19:25:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-11-09 19:25:22,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:22,009 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:25:22,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:25:22,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:22,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1202446625, now seen corresponding path program 1 times [2024-11-09 19:25:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877595623] [2024-11-09 19:25:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-11-09 19:25:22,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:22,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877595623] [2024-11-09 19:25:22,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877595623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647358741] [2024-11-09 19:25:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:22,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:22,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:22,451 INFO L87 Difference]: Start difference. First operand 74453 states and 152263 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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) [2024-11-09 19:25:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:25,931 INFO L93 Difference]: Finished difference Result 166952 states and 341406 transitions. [2024-11-09 19:25:25,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:25,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 478 [2024-11-09 19:25:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:26,050 INFO L225 Difference]: With dead ends: 166952 [2024-11-09 19:25:26,050 INFO L226 Difference]: Without dead ends: 92501 [2024-11-09 19:25:26,064 INFO L431 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 [2024-11-09 19:25:26,065 INFO L432 NwaCegarLoop]: 1792 mSDtfsCounter, 1494 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 4023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:26,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1802 Invalid, 4023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 19:25:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92501 states. [2024-11-09 19:25:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92501 to 92501. [2024-11-09 19:25:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92501 states, 92500 states have (on average 2.0318810810810812) internal successors, (187949), 92500 states have internal predecessors, (187949), 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) [2024-11-09 19:25:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92501 states to 92501 states and 187949 transitions. [2024-11-09 19:25:27,057 INFO L78 Accepts]: Start accepts. Automaton has 92501 states and 187949 transitions. Word has length 478 [2024-11-09 19:25:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:27,057 INFO L471 AbstractCegarLoop]: Abstraction has 92501 states and 187949 transitions. [2024-11-09 19:25:27,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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) [2024-11-09 19:25:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 92501 states and 187949 transitions. [2024-11-09 19:25:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-11-09 19:25:27,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:27,065 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:25:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:25:27,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:27,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:27,066 INFO L85 PathProgramCache]: Analyzing trace with hash 524822957, now seen corresponding path program 1 times [2024-11-09 19:25:27,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:27,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670658539] [2024-11-09 19:25:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:25:27,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:27,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670658539] [2024-11-09 19:25:27,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670658539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:27,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46422941] [2024-11-09 19:25:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:27,788 INFO L87 Difference]: Start difference. First operand 92501 states and 187949 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2024-11-09 19:25:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:31,278 INFO L93 Difference]: Finished difference Result 200040 states and 405937 transitions. [2024-11-09 19:25:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 516 [2024-11-09 19:25:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:31,440 INFO L225 Difference]: With dead ends: 200040 [2024-11-09 19:25:31,441 INFO L226 Difference]: Without dead ends: 107541 [2024-11-09 19:25:31,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:31,457 INFO L432 NwaCegarLoop]: 1577 mSDtfsCounter, 1427 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 4073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:31,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 1585 Invalid, 4073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 19:25:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107541 states. [2024-11-09 19:25:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107541 to 103029. [2024-11-09 19:25:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103029 states, 103028 states have (on average 2.0143941452808947) internal successors, (207539), 103028 states have internal predecessors, (207539), 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) [2024-11-09 19:25:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103029 states to 103029 states and 207539 transitions. [2024-11-09 19:25:32,786 INFO L78 Accepts]: Start accepts. Automaton has 103029 states and 207539 transitions. Word has length 516 [2024-11-09 19:25:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:32,787 INFO L471 AbstractCegarLoop]: Abstraction has 103029 states and 207539 transitions. [2024-11-09 19:25:32,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2024-11-09 19:25:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 103029 states and 207539 transitions. [2024-11-09 19:25:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-09 19:25:32,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:32,801 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:25:32,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:25:32,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:32,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash -836523583, now seen corresponding path program 1 times [2024-11-09 19:25:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966917307] [2024-11-09 19:25:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:32,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 569 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-09 19:25:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:33,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966917307] [2024-11-09 19:25:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966917307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300803048] [2024-11-09 19:25:33,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:33,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:33,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:33,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:33,369 INFO L87 Difference]: Start difference. First operand 103029 states and 207539 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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) [2024-11-09 19:25:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:37,144 INFO L93 Difference]: Finished difference Result 246664 states and 496369 transitions. [2024-11-09 19:25:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 602 [2024-11-09 19:25:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:37,342 INFO L225 Difference]: With dead ends: 246664 [2024-11-09 19:25:37,342 INFO L226 Difference]: Without dead ends: 138373 [2024-11-09 19:25:37,363 INFO L431 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 [2024-11-09 19:25:37,364 INFO L432 NwaCegarLoop]: 2000 mSDtfsCounter, 1262 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:37,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 2010 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:25:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138373 states. [2024-11-09 19:25:38,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138373 to 133861. [2024-11-09 19:25:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133861 states, 133860 states have (on average 1.999805767219483) internal successors, (267694), 133860 states have internal predecessors, (267694), 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) [2024-11-09 19:25:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133861 states to 133861 states and 267694 transitions. [2024-11-09 19:25:39,084 INFO L78 Accepts]: Start accepts. Automaton has 133861 states and 267694 transitions. Word has length 602 [2024-11-09 19:25:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:39,085 INFO L471 AbstractCegarLoop]: Abstraction has 133861 states and 267694 transitions. [2024-11-09 19:25:39,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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) [2024-11-09 19:25:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 133861 states and 267694 transitions. [2024-11-09 19:25:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-09 19:25:39,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:39,104 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:25:39,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:25:39,104 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:39,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -303980979, now seen corresponding path program 1 times [2024-11-09 19:25:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023645396] [2024-11-09 19:25:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-09 19:25:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023645396] [2024-11-09 19:25:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023645396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:39,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206732087] [2024-11-09 19:25:39,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:39,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:39,801 INFO L87 Difference]: Start difference. First operand 133861 states and 267694 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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) [2024-11-09 19:25:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:43,287 INFO L93 Difference]: Finished difference Result 270728 states and 541185 transitions. [2024-11-09 19:25:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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 602 [2024-11-09 19:25:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:43,798 INFO L225 Difference]: With dead ends: 270728 [2024-11-09 19:25:43,798 INFO L226 Difference]: Without dead ends: 137621 [2024-11-09 19:25:43,850 INFO L431 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 [2024-11-09 19:25:43,850 INFO L432 NwaCegarLoop]: 1858 mSDtfsCounter, 1412 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3434 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 4020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 3434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:43,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 1866 Invalid, 4020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 3434 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 19:25:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137621 states. [2024-11-09 19:25:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137621 to 130853. [2024-11-09 19:25:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130853 states, 130852 states have (on average 1.9753996881973528) internal successors, (258485), 130852 states have internal predecessors, (258485), 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) [2024-11-09 19:25:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130853 states to 130853 states and 258485 transitions. [2024-11-09 19:25:46,007 INFO L78 Accepts]: Start accepts. Automaton has 130853 states and 258485 transitions. Word has length 602 [2024-11-09 19:25:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:46,008 INFO L471 AbstractCegarLoop]: Abstraction has 130853 states and 258485 transitions. [2024-11-09 19:25:46,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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) [2024-11-09 19:25:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 130853 states and 258485 transitions. [2024-11-09 19:25:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2024-11-09 19:25:46,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:46,023 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:25:46,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:25:46,024 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1926452905, now seen corresponding path program 1 times [2024-11-09 19:25:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916669187] [2024-11-09 19:25:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2024-11-09 19:25:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:46,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916669187] [2024-11-09 19:25:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916669187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41480280] [2024-11-09 19:25:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:46,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:46,267 INFO L87 Difference]: Start difference. First operand 130853 states and 258485 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) [2024-11-09 19:25:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:25:49,996 INFO L93 Difference]: Finished difference Result 260952 states and 515531 transitions. [2024-11-09 19:25:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:25:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 626 [2024-11-09 19:25:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:25:50,155 INFO L225 Difference]: With dead ends: 260952 [2024-11-09 19:25:50,155 INFO L226 Difference]: Without dead ends: 130853 [2024-11-09 19:25:50,196 INFO L431 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 [2024-11-09 19:25:50,197 INFO L432 NwaCegarLoop]: 1977 mSDtfsCounter, 1411 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:25:50,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 1987 Invalid, 3938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 19:25:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130853 states. [2024-11-09 19:25:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130853 to 121829. [2024-11-09 19:25:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121829 states, 121828 states have (on average 1.9534753915356076) internal successors, (237988), 121828 states have internal predecessors, (237988), 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) [2024-11-09 19:25:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121829 states to 121829 states and 237988 transitions. [2024-11-09 19:25:52,161 INFO L78 Accepts]: Start accepts. Automaton has 121829 states and 237988 transitions. Word has length 626 [2024-11-09 19:25:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:25:52,163 INFO L471 AbstractCegarLoop]: Abstraction has 121829 states and 237988 transitions. [2024-11-09 19:25:52,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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) [2024-11-09 19:25:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 121829 states and 237988 transitions. [2024-11-09 19:25:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2024-11-09 19:25:52,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:25:52,178 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:25:52,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:25:52,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:25:52,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:25:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1813661637, now seen corresponding path program 1 times [2024-11-09 19:25:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:25:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184634604] [2024-11-09 19:25:52,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:25:52,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:25:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:25:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 1066 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2024-11-09 19:25:52,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:25:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184634604] [2024-11-09 19:25:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184634604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:25:52,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:25:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:25:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391592072] [2024-11-09 19:25:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:25:52,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:25:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:25:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:25:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:25:52,341 INFO L87 Difference]: Start difference. First operand 121829 states and 237988 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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)