./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label18.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/Problem15_label18.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 5c095fadf59684254d69cca06d3c4bb1b9fa7c0b1f04f6f3052257e0be0a70d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:41:18,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:41:18,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:41:18,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:41:18,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:41:18,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:41:18,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:41:18,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:41:18,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:41:18,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:41:18,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:41:18,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:41:18,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:41:18,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:41:18,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:41:18,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:41:18,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:41:18,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:41:18,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:41:18,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:41:18,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:41:18,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:41:18,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:41:18,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:41:18,388 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:41:18,388 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:41:18,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:41:18,389 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:41:18,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:41:18,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:41:18,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:41:18,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:41:18,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:41:18,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:41:18,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:41:18,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:41:18,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:41:18,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:41:18,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:41:18,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:41:18,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:41:18,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:41:18,393 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 -> 5c095fadf59684254d69cca06d3c4bb1b9fa7c0b1f04f6f3052257e0be0a70d1 [2024-11-09 19:41:18,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:41:18,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:41:18,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:41:18,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:41:18,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:41:18,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label18.c [2024-11-09 19:41:19,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:41:20,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:41:20,168 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label18.c [2024-11-09 19:41:20,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c77270cf/1c1e253446cd44df88659c804d07a4c6/FLAGe09fa4d50 [2024-11-09 19:41:20,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c77270cf/1c1e253446cd44df88659c804d07a4c6 [2024-11-09 19:41:20,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:41:20,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:41:20,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:41:20,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:41:20,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:41:20,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:20,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab7c122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20, skipping insertion in model container [2024-11-09 19:41:20,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:20,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:41:20,454 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/Problem15_label18.c[1259,1272] [2024-11-09 19:41:20,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:41:20,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:41:20,787 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/Problem15_label18.c[1259,1272] [2024-11-09 19:41:20,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:41:20,944 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:41:20,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20 WrapperNode [2024-11-09 19:41:20,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:41:20,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:41:20,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:41:20,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:41:20,951 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:41:20" (1/1) ... [2024-11-09 19:41:20,981 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:41:20" (1/1) ... [2024-11-09 19:41:21,099 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-09 19:41:21,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:41:21,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:41:21,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:41:21,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:41:21,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,184 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:41:21,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:41:21,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:41:21,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:41:21,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:41:21,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (1/1) ... [2024-11-09 19:41:21,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:41:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:21,453 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:41:21,461 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:41:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:41:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:41:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:41:21,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:41:21,593 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:41:21,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:41:23,600 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2024-11-09 19:41:23,706 INFO L? ?]: Removed 697 outVars from TransFormulas that were not future-live. [2024-11-09 19:41:23,706 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:41:23,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:41:23,731 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:41:23,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:41:23 BoogieIcfgContainer [2024-11-09 19:41:23,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:41:23,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:41:23,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:41:23,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:41:23,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:41:20" (1/3) ... [2024-11-09 19:41:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536347db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:23, skipping insertion in model container [2024-11-09 19:41:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:20" (2/3) ... [2024-11-09 19:41:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536347db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:23, skipping insertion in model container [2024-11-09 19:41:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:41:23" (3/3) ... [2024-11-09 19:41:23,737 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label18.c [2024-11-09 19:41:23,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:41:23,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:41:23,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:41:23,804 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;@7b94d56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:41:23,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:41:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 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:41:23,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 19:41:23,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:23,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:23,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:23,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:23,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1736034795, now seen corresponding path program 1 times [2024-11-09 19:41:23,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:23,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683691028] [2024-11-09 19:41:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:23,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:23,957 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:41:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683691028] [2024-11-09 19:41:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683691028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611737402] [2024-11-09 19:41:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:23,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:23,980 INFO L87 Difference]: Start difference. First operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 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 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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:41:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:26,075 INFO L93 Difference]: Finished difference Result 1160 states and 2808 transitions. [2024-11-09 19:41:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:26,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-09 19:41:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:26,092 INFO L225 Difference]: With dead ends: 1160 [2024-11-09 19:41:26,092 INFO L226 Difference]: Without dead ends: 668 [2024-11-09 19:41:26,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:41:26,097 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 545 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:26,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 388 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:41:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-09 19:41:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2024-11-09 19:41:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 2.177443609022556) internal successors, (1448), 665 states have internal predecessors, (1448), 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:41:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1448 transitions. [2024-11-09 19:41:26,150 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1448 transitions. Word has length 10 [2024-11-09 19:41:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:26,151 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1448 transitions. [2024-11-09 19:41:26,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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:41:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1448 transitions. [2024-11-09 19:41:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 19:41:26,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:26,153 INFO L215 NwaCegarLoop]: trace histogram [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:41:26,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:41:26,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:26,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1735672497, now seen corresponding path program 1 times [2024-11-09 19:41:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:26,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793861173] [2024-11-09 19:41:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:26,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793861173] [2024-11-09 19:41:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793861173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:26,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278883230] [2024-11-09 19:41:26,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:26,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:26,401 INFO L87 Difference]: Start difference. First operand 666 states and 1448 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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:41:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:27,990 INFO L93 Difference]: Finished difference Result 1631 states and 3482 transitions. [2024-11-09 19:41:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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 76 [2024-11-09 19:41:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:27,994 INFO L225 Difference]: With dead ends: 1631 [2024-11-09 19:41:27,994 INFO L226 Difference]: Without dead ends: 967 [2024-11-09 19:41:27,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:41:27,996 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 469 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:27,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 341 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:41:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-09 19:41:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2024-11-09 19:41:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.0817805383022776) internal successors, (2011), 966 states have internal predecessors, (2011), 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:41:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2011 transitions. [2024-11-09 19:41:28,022 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2011 transitions. Word has length 76 [2024-11-09 19:41:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:28,022 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 2011 transitions. [2024-11-09 19:41:28,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 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:41:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2011 transitions. [2024-11-09 19:41:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 19:41:28,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:28,024 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:41:28,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:41:28,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:28,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -234863708, now seen corresponding path program 1 times [2024-11-09 19:41:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714982156] [2024-11-09 19:41:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714982156] [2024-11-09 19:41:28,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714982156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:28,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968932351] [2024-11-09 19:41:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:28,162 INFO L87 Difference]: Start difference. First operand 967 states and 2011 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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:41:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:29,991 INFO L93 Difference]: Finished difference Result 2238 states and 4819 transitions. [2024-11-09 19:41:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:29,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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 81 [2024-11-09 19:41:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:29,998 INFO L225 Difference]: With dead ends: 2238 [2024-11-09 19:41:29,998 INFO L226 Difference]: Without dead ends: 1573 [2024-11-09 19:41:30,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:41:30,002 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 488 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:30,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 322 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:41:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-09 19:41:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1271. [2024-11-09 19:41:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 2.0338582677165356) internal successors, (2583), 1270 states have internal predecessors, (2583), 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:41:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2583 transitions. [2024-11-09 19:41:30,023 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2583 transitions. Word has length 81 [2024-11-09 19:41:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:30,025 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 2583 transitions. [2024-11-09 19:41:30,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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:41:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2583 transitions. [2024-11-09 19:41:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 19:41:30,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:30,032 INFO L215 NwaCegarLoop]: trace histogram [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, 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:41:30,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:41:30,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:30,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1716979342, now seen corresponding path program 1 times [2024-11-09 19:41:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:30,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020599487] [2024-11-09 19:41:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-09 19:41:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:30,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020599487] [2024-11-09 19:41:30,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020599487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:30,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:30,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:30,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267300597] [2024-11-09 19:41:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:30,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:30,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:30,271 INFO L87 Difference]: Start difference. First operand 1271 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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:41:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:32,060 INFO L93 Difference]: Finished difference Result 3450 states and 7116 transitions. [2024-11-09 19:41:32,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 178 [2024-11-09 19:41:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:32,077 INFO L225 Difference]: With dead ends: 3450 [2024-11-09 19:41:32,078 INFO L226 Difference]: Without dead ends: 2181 [2024-11-09 19:41:32,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:41:32,080 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 490 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:32,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 344 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:41:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2024-11-09 19:41:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2176. [2024-11-09 19:41:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2175 states have (on average 1.9802298850574713) internal successors, (4307), 2175 states have internal predecessors, (4307), 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:41:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 4307 transitions. [2024-11-09 19:41:32,163 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 4307 transitions. Word has length 178 [2024-11-09 19:41:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:32,164 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 4307 transitions. [2024-11-09 19:41:32,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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:41:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 4307 transitions. [2024-11-09 19:41:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-09 19:41:32,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:32,175 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:32,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:41:32,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -749074522, now seen corresponding path program 1 times [2024-11-09 19:41:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443112418] [2024-11-09 19:41:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:32,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 19:41:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443112418] [2024-11-09 19:41:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443112418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:41:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236433345] [2024-11-09 19:41:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:32,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:32,701 INFO L87 Difference]: Start difference. First operand 2176 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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:41:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:34,032 INFO L93 Difference]: Finished difference Result 4650 states and 9156 transitions. [2024-11-09 19:41:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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 284 [2024-11-09 19:41:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:34,040 INFO L225 Difference]: With dead ends: 4650 [2024-11-09 19:41:34,040 INFO L226 Difference]: Without dead ends: 2476 [2024-11-09 19:41:34,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:41:34,042 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 337 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:34,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 363 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:41:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2024-11-09 19:41:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2024-11-09 19:41:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.9575757575757575) internal successors, (4845), 2475 states have internal predecessors, (4845), 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:41:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4845 transitions. [2024-11-09 19:41:34,070 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4845 transitions. Word has length 284 [2024-11-09 19:41:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:34,071 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 4845 transitions. [2024-11-09 19:41:34,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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:41:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4845 transitions. [2024-11-09 19:41:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-09 19:41:34,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:34,075 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:34,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:41:34,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:34,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1420006979, now seen corresponding path program 1 times [2024-11-09 19:41:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:34,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485088018] [2024-11-09 19:41:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:41:34,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:34,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485088018] [2024-11-09 19:41:34,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485088018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:34,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:34,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404312519] [2024-11-09 19:41:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:34,262 INFO L87 Difference]: Start difference. First operand 2476 states and 4845 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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:41:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:35,784 INFO L93 Difference]: Finished difference Result 5251 states and 10505 transitions. [2024-11-09 19:41:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 299 [2024-11-09 19:41:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:35,793 INFO L225 Difference]: With dead ends: 5251 [2024-11-09 19:41:35,793 INFO L226 Difference]: Without dead ends: 3077 [2024-11-09 19:41:35,795 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:41:35,796 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 539 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:35,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 327 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:41:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2024-11-09 19:41:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2173. [2024-11-09 19:41:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2172 states have (on average 1.977900552486188) internal successors, (4296), 2172 states have internal predecessors, (4296), 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:41:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 4296 transitions. [2024-11-09 19:41:35,881 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 4296 transitions. Word has length 299 [2024-11-09 19:41:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:35,881 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 4296 transitions. [2024-11-09 19:41:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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:41:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 4296 transitions. [2024-11-09 19:41:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-09 19:41:35,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:35,885 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:41:35,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash 956787447, now seen corresponding path program 1 times [2024-11-09 19:41:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541988701] [2024-11-09 19:41:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:41:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541988701] [2024-11-09 19:41:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541988701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:36,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:36,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924926065] [2024-11-09 19:41:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:36,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:36,124 INFO L87 Difference]: Start difference. First operand 2173 states and 4296 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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:41:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:37,608 INFO L93 Difference]: Finished difference Result 5254 states and 10588 transitions. [2024-11-09 19:41:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:37,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 358 [2024-11-09 19:41:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:37,617 INFO L225 Difference]: With dead ends: 5254 [2024-11-09 19:41:37,617 INFO L226 Difference]: Without dead ends: 3383 [2024-11-09 19:41:37,619 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:41:37,619 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 552 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:37,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 873 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 19:41:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2024-11-09 19:41:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3083. [2024-11-09 19:41:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3082 states have (on average 1.9383517196625568) internal successors, (5974), 3082 states have internal predecessors, (5974), 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:41:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 5974 transitions. [2024-11-09 19:41:37,650 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 5974 transitions. Word has length 358 [2024-11-09 19:41:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:37,651 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 5974 transitions. [2024-11-09 19:41:37,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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:41:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 5974 transitions. [2024-11-09 19:41:37,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-09 19:41:37,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:37,654 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:41:37,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:37,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -177032619, now seen corresponding path program 1 times [2024-11-09 19:41:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993846333] [2024-11-09 19:41:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:37,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:37,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993846333] [2024-11-09 19:41:37,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993846333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624972178] [2024-11-09 19:41:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:37,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:37,887 INFO L87 Difference]: Start difference. First operand 3083 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:41:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:39,506 INFO L93 Difference]: Finished difference Result 7075 states and 13950 transitions. [2024-11-09 19:41:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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 363 [2024-11-09 19:41:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:39,516 INFO L225 Difference]: With dead ends: 7075 [2024-11-09 19:41:39,517 INFO L226 Difference]: Without dead ends: 4294 [2024-11-09 19:41:39,519 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:41:39,519 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 479 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:39,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 841 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:41:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2024-11-09 19:41:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 3991. [2024-11-09 19:41:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3990 states have (on average 1.9210526315789473) internal successors, (7665), 3990 states have internal predecessors, (7665), 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:41:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 7665 transitions. [2024-11-09 19:41:39,559 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 7665 transitions. Word has length 363 [2024-11-09 19:41:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:39,559 INFO L471 AbstractCegarLoop]: Abstraction has 3991 states and 7665 transitions. [2024-11-09 19:41:39,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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:41:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 7665 transitions. [2024-11-09 19:41:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-09 19:41:39,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:39,563 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:39,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:41:39,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:39,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1987539778, now seen corresponding path program 1 times [2024-11-09 19:41:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:39,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615237906] [2024-11-09 19:41:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:41:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:39,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615237906] [2024-11-09 19:41:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615237906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:39,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:39,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:39,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64881860] [2024-11-09 19:41:39,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:39,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:39,846 INFO L87 Difference]: Start difference. First operand 3991 states and 7665 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:41:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:41,421 INFO L93 Difference]: Finished difference Result 8881 states and 17320 transitions. [2024-11-09 19:41:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:41,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 382 [2024-11-09 19:41:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:41,438 INFO L225 Difference]: With dead ends: 8881 [2024-11-09 19:41:41,438 INFO L226 Difference]: Without dead ends: 5192 [2024-11-09 19:41:41,441 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:41:41,441 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 478 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:41,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 855 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:41:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2024-11-09 19:41:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 4889. [2024-11-09 19:41:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4889 states, 4888 states have (on average 1.9122340425531914) internal successors, (9347), 4888 states have internal predecessors, (9347), 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:41:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 9347 transitions. [2024-11-09 19:41:41,487 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 9347 transitions. Word has length 382 [2024-11-09 19:41:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:41,488 INFO L471 AbstractCegarLoop]: Abstraction has 4889 states and 9347 transitions. [2024-11-09 19:41:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:41:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 9347 transitions. [2024-11-09 19:41:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-11-09 19:41:41,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:41,493 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:41,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:41:41,494 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:41,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1852332377, now seen corresponding path program 1 times [2024-11-09 19:41:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484619688] [2024-11-09 19:41:41,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 557 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-09 19:41:41,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484619688] [2024-11-09 19:41:41,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484619688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:41,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:41,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136988295] [2024-11-09 19:41:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:41,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:41,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:41,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:41,693 INFO L87 Difference]: Start difference. First operand 4889 states and 9347 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:41:43,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:43,297 INFO L93 Difference]: Finished difference Result 12474 states and 24038 transitions. [2024-11-09 19:41:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 498 [2024-11-09 19:41:43,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:43,308 INFO L225 Difference]: With dead ends: 12474 [2024-11-09 19:41:43,308 INFO L226 Difference]: Without dead ends: 7887 [2024-11-09 19:41:43,312 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:41:43,312 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 564 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:43,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 268 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:41:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7887 states. [2024-11-09 19:41:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7887 to 6387. [2024-11-09 19:41:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 6386 states have (on average 1.9151268399624177) internal successors, (12230), 6386 states have internal predecessors, (12230), 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:41:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 12230 transitions. [2024-11-09 19:41:43,372 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 12230 transitions. Word has length 498 [2024-11-09 19:41:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:43,374 INFO L471 AbstractCegarLoop]: Abstraction has 6387 states and 12230 transitions. [2024-11-09 19:41:43,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:41:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 12230 transitions. [2024-11-09 19:41:43,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-11-09 19:41:43,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:43,381 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:43,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:41:43,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:43,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1694903909, now seen corresponding path program 1 times [2024-11-09 19:41:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88169909] [2024-11-09 19:41:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:43,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-09 19:41:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88169909] [2024-11-09 19:41:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88169909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798120424] [2024-11-09 19:41:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:43,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:43,732 INFO L87 Difference]: Start difference. First operand 6387 states and 12230 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:41:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:45,482 INFO L93 Difference]: Finished difference Result 16986 states and 32654 transitions. [2024-11-09 19:41:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:45,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 502 [2024-11-09 19:41:45,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:45,497 INFO L225 Difference]: With dead ends: 16986 [2024-11-09 19:41:45,497 INFO L226 Difference]: Without dead ends: 10901 [2024-11-09 19:41:45,501 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:41:45,502 INFO L432 NwaCegarLoop]: 821 mSDtfsCounter, 480 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:45,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 854 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:41:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10901 states. [2024-11-09 19:41:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10901 to 10890. [2024-11-09 19:41:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10890 states, 10889 states have (on average 1.8944806685646065) internal successors, (20629), 10889 states have internal predecessors, (20629), 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:41:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10890 states to 10890 states and 20629 transitions. [2024-11-09 19:41:45,588 INFO L78 Accepts]: Start accepts. Automaton has 10890 states and 20629 transitions. Word has length 502 [2024-11-09 19:41:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:45,589 INFO L471 AbstractCegarLoop]: Abstraction has 10890 states and 20629 transitions. [2024-11-09 19:41:45,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:41:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 10890 states and 20629 transitions. [2024-11-09 19:41:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2024-11-09 19:41:45,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:45,592 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:41:45,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2146660331, now seen corresponding path program 1 times [2024-11-09 19:41:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348820266] [2024-11-09 19:41:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-09 19:41:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348820266] [2024-11-09 19:41:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348820266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874506066] [2024-11-09 19:41:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:45,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:45,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:45,806 INFO L87 Difference]: Start difference. First operand 10890 states and 20629 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:41:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:47,630 INFO L93 Difference]: Finished difference Result 21776 states and 41290 transitions. [2024-11-09 19:41:47,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 514 [2024-11-09 19:41:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:47,645 INFO L225 Difference]: With dead ends: 21776 [2024-11-09 19:41:47,646 INFO L226 Difference]: Without dead ends: 11188 [2024-11-09 19:41:47,652 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:41:47,652 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 698 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:47,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 73 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:41:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11188 states. [2024-11-09 19:41:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11188 to 10888. [2024-11-09 19:41:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10888 states, 10887 states have (on average 1.894461284100303) internal successors, (20625), 10887 states have internal predecessors, (20625), 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:41:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10888 states to 10888 states and 20625 transitions. [2024-11-09 19:41:47,742 INFO L78 Accepts]: Start accepts. Automaton has 10888 states and 20625 transitions. Word has length 514 [2024-11-09 19:41:47,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:47,743 INFO L471 AbstractCegarLoop]: Abstraction has 10888 states and 20625 transitions. [2024-11-09 19:41:47,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:41:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10888 states and 20625 transitions. [2024-11-09 19:41:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2024-11-09 19:41:47,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:47,747 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:47,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:41:47,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:47,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 346580776, now seen corresponding path program 1 times [2024-11-09 19:41:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317833180] [2024-11-09 19:41:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-09 19:41:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:47,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317833180] [2024-11-09 19:41:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317833180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:47,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:47,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:47,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667048291] [2024-11-09 19:41:47,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:47,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:47,953 INFO L87 Difference]: Start difference. First operand 10888 states and 20625 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:41:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:49,327 INFO L93 Difference]: Finished difference Result 22974 states and 43556 transitions. [2024-11-09 19:41:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 535 [2024-11-09 19:41:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:49,353 INFO L225 Difference]: With dead ends: 22974 [2024-11-09 19:41:49,353 INFO L226 Difference]: Without dead ends: 12388 [2024-11-09 19:41:49,362 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:41:49,363 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 500 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:49,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 330 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:41:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2024-11-09 19:41:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 8785. [2024-11-09 19:41:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8785 states, 8784 states have (on average 1.9065346083788706) internal successors, (16747), 8784 states have internal predecessors, (16747), 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:41:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8785 states to 8785 states and 16747 transitions. [2024-11-09 19:41:49,510 INFO L78 Accepts]: Start accepts. Automaton has 8785 states and 16747 transitions. Word has length 535 [2024-11-09 19:41:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:49,511 INFO L471 AbstractCegarLoop]: Abstraction has 8785 states and 16747 transitions. [2024-11-09 19:41:49,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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:41:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 8785 states and 16747 transitions. [2024-11-09 19:41:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-09 19:41:49,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:49,520 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:41:49,520 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash 477486861, now seen corresponding path program 1 times [2024-11-09 19:41:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:49,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125617717] [2024-11-09 19:41:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 342 proven. 192 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 19:41:50,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:50,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125617717] [2024-11-09 19:41:50,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125617717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:41:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507467952] [2024-11-09 19:41:50,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:50,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:50,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:50,109 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:41:50,112 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:41:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:50,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:41:50,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-09 19:42:00,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:42:00,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507467952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:00,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:42:00,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:42:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766251726] [2024-11-09 19:42:00,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:42:00,940 INFO L87 Difference]: Start difference. First operand 8785 states and 16747 transitions. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:42:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:02,745 INFO L93 Difference]: Finished difference Result 22674 states and 43371 transitions. [2024-11-09 19:42:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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 556 [2024-11-09 19:42:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:02,758 INFO L225 Difference]: With dead ends: 22674 [2024-11-09 19:42:02,759 INFO L226 Difference]: Without dead ends: 14191 [2024-11-09 19:42:02,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:42:02,765 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 525 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:02,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 199 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:42:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2024-11-09 19:42:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11188. [2024-11-09 19:42:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11188 states, 11187 states have (on average 1.9223205506391348) internal successors, (21505), 11187 states have internal predecessors, (21505), 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:42:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11188 states to 11188 states and 21505 transitions. [2024-11-09 19:42:02,858 INFO L78 Accepts]: Start accepts. Automaton has 11188 states and 21505 transitions. Word has length 556 [2024-11-09 19:42:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:02,858 INFO L471 AbstractCegarLoop]: Abstraction has 11188 states and 21505 transitions. [2024-11-09 19:42:02,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:42:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11188 states and 21505 transitions. [2024-11-09 19:42:02,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2024-11-09 19:42:02,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:02,863 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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:42:02,877 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:42:03,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 19:42:03,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1464863948, now seen corresponding path program 1 times [2024-11-09 19:42:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93451020] [2024-11-09 19:42:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:03,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 587 proven. 39 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-09 19:42:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93451020] [2024-11-09 19:42:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93451020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971244838] [2024-11-09 19:42:03,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:03,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:03,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:03,475 INFO L229 MonitoredProcess]: Starting monitored process 3 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:42:03,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:42:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:03,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:42:03,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-09 19:42:03,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:42:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971244838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:03,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:42:03,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:42:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872821322] [2024-11-09 19:42:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:03,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:03,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:42:03,725 INFO L87 Difference]: Start difference. First operand 11188 states and 21505 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:42:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:05,451 INFO L93 Difference]: Finished difference Result 22071 states and 42466 transitions. [2024-11-09 19:42:05,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 578 [2024-11-09 19:42:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:05,466 INFO L225 Difference]: With dead ends: 22071 [2024-11-09 19:42:05,466 INFO L226 Difference]: Without dead ends: 11185 [2024-11-09 19:42:05,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:42:05,474 INFO L432 NwaCegarLoop]: 797 mSDtfsCounter, 484 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:05,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 834 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:42:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2024-11-09 19:42:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 11185. [2024-11-09 19:42:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11185 states, 11184 states have (on average 1.8623032904148784) internal successors, (20828), 11184 states have internal predecessors, (20828), 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:42:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11185 states to 11185 states and 20828 transitions. [2024-11-09 19:42:05,616 INFO L78 Accepts]: Start accepts. Automaton has 11185 states and 20828 transitions. Word has length 578 [2024-11-09 19:42:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:05,617 INFO L471 AbstractCegarLoop]: Abstraction has 11185 states and 20828 transitions. [2024-11-09 19:42:05,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:42:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11185 states and 20828 transitions. [2024-11-09 19:42:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2024-11-09 19:42:05,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:05,625 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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] [2024-11-09 19:42:05,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:42:05,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 19:42:05,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:05,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:05,830 INFO L85 PathProgramCache]: Analyzing trace with hash 141756832, now seen corresponding path program 1 times [2024-11-09 19:42:05,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501112030] [2024-11-09 19:42:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 512 proven. 39 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 19:42:06,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501112030] [2024-11-09 19:42:06,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501112030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:06,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689507716] [2024-11-09 19:42:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:06,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:06,284 INFO L229 MonitoredProcess]: Starting monitored process 4 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:42:06,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:42:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:06,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 19:42:06,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 512 proven. 39 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 19:42:07,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:42:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 512 proven. 39 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-09 19:42:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689507716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:42:07,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:42:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-09 19:42:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101400245] [2024-11-09 19:42:07,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:42:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 19:42:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:07,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 19:42:07,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:42:07,636 INFO L87 Difference]: Start difference. First operand 11185 states and 20828 transitions. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 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:42:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:15,012 INFO L93 Difference]: Finished difference Result 29428 states and 54618 transitions. [2024-11-09 19:42:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 19:42:15,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 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 578 [2024-11-09 19:42:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:15,029 INFO L225 Difference]: With dead ends: 29428 [2024-11-09 19:42:15,029 INFO L226 Difference]: Without dead ends: 13586 [2024-11-09 19:42:15,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1165 GetRequests, 1151 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-09 19:42:15,040 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 6310 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 7749 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6310 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 8393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 7749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:15,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6310 Valid, 213 Invalid, 8393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 7749 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-09 19:42:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13586 states. [2024-11-09 19:42:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13586 to 13283. [2024-11-09 19:42:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13283 states, 13282 states have (on average 1.8061285950911008) internal successors, (23989), 13282 states have internal predecessors, (23989), 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:42:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13283 states to 13283 states and 23989 transitions. [2024-11-09 19:42:15,178 INFO L78 Accepts]: Start accepts. Automaton has 13283 states and 23989 transitions. Word has length 578 [2024-11-09 19:42:15,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:15,178 INFO L471 AbstractCegarLoop]: Abstraction has 13283 states and 23989 transitions. [2024-11-09 19:42:15,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 8 states have internal predecessors, (785), 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:42:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 13283 states and 23989 transitions. [2024-11-09 19:42:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-11-09 19:42:15,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:15,185 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:15,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:42:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:15,389 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:15,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1998038549, now seen corresponding path program 1 times [2024-11-09 19:42:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:15,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281662220] [2024-11-09 19:42:15,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-09 19:42:15,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:15,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281662220] [2024-11-09 19:42:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281662220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219168510] [2024-11-09 19:42:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:15,742 INFO L87 Difference]: Start difference. First operand 13283 states and 23989 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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:42:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:17,036 INFO L93 Difference]: Finished difference Result 31374 states and 56726 transitions. [2024-11-09 19:42:17,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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 593 [2024-11-09 19:42:17,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:17,054 INFO L225 Difference]: With dead ends: 31374 [2024-11-09 19:42:17,054 INFO L226 Difference]: Without dead ends: 18393 [2024-11-09 19:42:17,063 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:42:17,064 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 456 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:17,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 695 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:42:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18393 states. [2024-11-09 19:42:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18393 to 17492. [2024-11-09 19:42:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17492 states, 17491 states have (on average 1.8038991481333257) internal successors, (31552), 17491 states have internal predecessors, (31552), 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:42:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17492 states to 17492 states and 31552 transitions. [2024-11-09 19:42:17,210 INFO L78 Accepts]: Start accepts. Automaton has 17492 states and 31552 transitions. Word has length 593 [2024-11-09 19:42:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:17,211 INFO L471 AbstractCegarLoop]: Abstraction has 17492 states and 31552 transitions. [2024-11-09 19:42:17,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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:42:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 17492 states and 31552 transitions. [2024-11-09 19:42:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2024-11-09 19:42:17,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:17,215 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:17,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 19:42:17,216 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:17,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2064646092, now seen corresponding path program 1 times [2024-11-09 19:42:17,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:17,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211811354] [2024-11-09 19:42:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:17,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-09 19:42:17,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:17,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211811354] [2024-11-09 19:42:17,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211811354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:17,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:17,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912756784] [2024-11-09 19:42:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:17,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:17,587 INFO L87 Difference]: Start difference. First operand 17492 states and 31552 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:42:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:18,766 INFO L93 Difference]: Finished difference Result 37992 states and 68550 transitions. [2024-11-09 19:42:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 633 [2024-11-09 19:42:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:18,787 INFO L225 Difference]: With dead ends: 37992 [2024-11-09 19:42:18,787 INFO L226 Difference]: Without dead ends: 20502 [2024-11-09 19:42:18,798 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:42:18,799 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 579 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:18,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 133 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:42:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20502 states. [2024-11-09 19:42:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20502 to 18391. [2024-11-09 19:42:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18391 states, 18390 states have (on average 1.8013050570962479) internal successors, (33126), 18390 states have internal predecessors, (33126), 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:42:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18391 states to 18391 states and 33126 transitions. [2024-11-09 19:42:18,947 INFO L78 Accepts]: Start accepts. Automaton has 18391 states and 33126 transitions. Word has length 633 [2024-11-09 19:42:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:18,947 INFO L471 AbstractCegarLoop]: Abstraction has 18391 states and 33126 transitions. [2024-11-09 19:42:18,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:42:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 18391 states and 33126 transitions. [2024-11-09 19:42:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-11-09 19:42:18,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:18,951 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:18,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 19:42:18,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:18,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash 817416450, now seen corresponding path program 1 times [2024-11-09 19:42:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:18,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113945093] [2024-11-09 19:42:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-09 19:42:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113945093] [2024-11-09 19:42:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113945093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:19,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:42:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422026199] [2024-11-09 19:42:19,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:19,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:42:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:42:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:42:19,245 INFO L87 Difference]: Start difference. First operand 18391 states and 33126 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:42:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:20,444 INFO L93 Difference]: Finished difference Result 38578 states and 69493 transitions. [2024-11-09 19:42:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:42:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 639 [2024-11-09 19:42:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:20,463 INFO L225 Difference]: With dead ends: 38578 [2024-11-09 19:42:20,463 INFO L226 Difference]: Without dead ends: 20489 [2024-11-09 19:42:20,468 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:42:20,468 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 469 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:20,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 734 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:42:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20489 states. [2024-11-09 19:42:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20489 to 19889. [2024-11-09 19:42:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19889 states, 19888 states have (on average 1.7989239742558327) internal successors, (35777), 19888 states have internal predecessors, (35777), 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:42:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19889 states to 19889 states and 35777 transitions. [2024-11-09 19:42:20,613 INFO L78 Accepts]: Start accepts. Automaton has 19889 states and 35777 transitions. Word has length 639 [2024-11-09 19:42:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:20,614 INFO L471 AbstractCegarLoop]: Abstraction has 19889 states and 35777 transitions. [2024-11-09 19:42:20,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:42:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19889 states and 35777 transitions. [2024-11-09 19:42:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2024-11-09 19:42:20,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:20,618 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2024-11-09 19:42:20,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 19:42:20,618 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:20,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 387531451, now seen corresponding path program 1 times [2024-11-09 19:42:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727670390] [2024-11-09 19:42:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 226 proven. 270 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 19:42:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727670390] [2024-11-09 19:42:21,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727670390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:21,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149581755] [2024-11-09 19:42:21,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:21,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:21,623 INFO L229 MonitoredProcess]: Starting monitored process 5 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:42:21,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:42:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:21,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 19:42:21,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-11-09 19:42:22,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:42:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-11-09 19:42:35,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149581755] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:35,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:42:35,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2024-11-09 19:42:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244250880] [2024-11-09 19:42:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:35,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:42:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:42:35,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:42:35,148 INFO L87 Difference]: Start difference. First operand 19889 states and 35777 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 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:42:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:37,559 INFO L93 Difference]: Finished difference Result 40375 states and 72657 transitions. [2024-11-09 19:42:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:42:37,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 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 664 [2024-11-09 19:42:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:37,578 INFO L225 Difference]: With dead ends: 40375 [2024-11-09 19:42:37,578 INFO L226 Difference]: Without dead ends: 20788 [2024-11-09 19:42:37,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1330 GetRequests, 1323 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 19:42:37,589 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 903 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:37,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 96 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 19:42:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20788 states. [2024-11-09 19:42:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20788 to 18988. [2024-11-09 19:42:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18988 states, 18987 states have (on average 1.7968610101648497) internal successors, (34117), 18987 states have internal predecessors, (34117), 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:42:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18988 states to 18988 states and 34117 transitions. [2024-11-09 19:42:37,743 INFO L78 Accepts]: Start accepts. Automaton has 18988 states and 34117 transitions. Word has length 664 [2024-11-09 19:42:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:37,744 INFO L471 AbstractCegarLoop]: Abstraction has 18988 states and 34117 transitions. [2024-11-09 19:42:37,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 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:42:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 18988 states and 34117 transitions. [2024-11-09 19:42:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2024-11-09 19:42:37,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:37,748 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:37,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 19:42:37,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:37,953 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1222083030, now seen corresponding path program 1 times [2024-11-09 19:42:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:37,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203112826] [2024-11-09 19:42:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:42:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203112826] [2024-11-09 19:42:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203112826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:42:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:42:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:42:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67463798] [2024-11-09 19:42:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:42:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:42:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:42:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:42:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:42:38,535 INFO L87 Difference]: Start difference. First operand 18988 states and 34117 transitions. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 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:42:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:42:40,767 INFO L93 Difference]: Finished difference Result 42193 states and 75797 transitions. [2024-11-09 19:42:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:42:40,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 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 687 [2024-11-09 19:42:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:42:40,792 INFO L225 Difference]: With dead ends: 42193 [2024-11-09 19:42:40,792 INFO L226 Difference]: Without dead ends: 23507 [2024-11-09 19:42:40,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:42:40,803 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 830 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:42:40,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 774 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:42:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2024-11-09 19:42:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 19294. [2024-11-09 19:42:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19294 states, 19293 states have (on average 1.7952106981806872) internal successors, (34635), 19293 states have internal predecessors, (34635), 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:42:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19294 states to 19294 states and 34635 transitions. [2024-11-09 19:42:40,973 INFO L78 Accepts]: Start accepts. Automaton has 19294 states and 34635 transitions. Word has length 687 [2024-11-09 19:42:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:42:40,973 INFO L471 AbstractCegarLoop]: Abstraction has 19294 states and 34635 transitions. [2024-11-09 19:42:40,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 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:42:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 19294 states and 34635 transitions. [2024-11-09 19:42:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2024-11-09 19:42:40,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:42:40,979 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:40,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 19:42:40,979 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:42:40,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:42:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash 521422752, now seen corresponding path program 1 times [2024-11-09 19:42:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:42:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848115197] [2024-11-09 19:42:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:42:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 502 proven. 189 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 19:42:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:42:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848115197] [2024-11-09 19:42:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848115197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:42:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345764267] [2024-11-09 19:42:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:42:41,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:42:41,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:42:41,878 INFO L229 MonitoredProcess]: Starting monitored process 6 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:42:41,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 19:42:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:42:42,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 19:42:42,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:42:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 502 proven. 189 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 19:42:43,395 INFO L311 TraceCheckSpWp]: Computing backward predicates...