./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label03.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 38485e244c681c1fbb49eda40c64ac8e945460513c205b9d5f83ef411865faaa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:50:19,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:50:19,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:50:19,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:50:19,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:50:19,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:50:19,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:50:19,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:50:19,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:50:19,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:50:19,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:50:19,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:50:19,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:50:19,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:50:19,683 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:50:19,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:50:19,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:50:19,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:50:19,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:50:19,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:50:19,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:50:19,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:50:19,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:50:19,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:50:19,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:50:19,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:50:19,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:50:19,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:50:19,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:50:19,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:50:19,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:50:19,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:50:19,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:50:19,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:50:19,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:50:19,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:50:19,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:50:19,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:50:19,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:50:19,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:50:19,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:50:19,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:50:19,698 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-clean/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-clean/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 -> 38485e244c681c1fbb49eda40c64ac8e945460513c205b9d5f83ef411865faaa [2024-10-10 23:50:19,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:50:19,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:50:19,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:50:19,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:50:19,997 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:50:19,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label03.c [2024-10-10 23:50:21,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:50:22,000 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:50:22,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label03.c [2024-10-10 23:50:22,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80637b666/84d3dd3dab824eff9d48b0a5f4f4dbb0/FLAGae09350b2 [2024-10-10 23:50:22,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80637b666/84d3dd3dab824eff9d48b0a5f4f4dbb0 [2024-10-10 23:50:22,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:50:22,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:50:22,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:50:22,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:50:22,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:50:22,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:50:22" (1/1) ... [2024-10-10 23:50:22,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c0cfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:22, skipping insertion in model container [2024-10-10 23:50:22,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:50:22" (1/1) ... [2024-10-10 23:50:22,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:50:22,530 WARN L248 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/Problem18_label03.c[1533,1546] [2024-10-10 23:50:23,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:50:23,272 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:50:23,289 WARN L248 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/Problem18_label03.c[1533,1546] [2024-10-10 23:50:23,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:50:23,581 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:50:23,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23 WrapperNode [2024-10-10 23:50:23,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:50:23,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:50:23,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:50:23,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:50:23,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:23,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:23,889 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-10-10 23:50:23,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:50:23,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:50:23,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:50:23,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:50:23,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:23,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,168 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-10-10 23:50:24,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:50:24,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:50:24,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:50:24,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:50:24,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (1/1) ... [2024-10-10 23:50:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:50:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:50:24,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:50:24,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:50:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:50:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:50:24,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:50:24,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:50:24,524 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:50:24,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:50:27,945 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-10-10 23:50:27,945 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:50:28,005 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:50:28,006 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:50:28,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:50:28 BoogieIcfgContainer [2024-10-10 23:50:28,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:50:28,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:50:28,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:50:28,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:50:28,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:50:22" (1/3) ... [2024-10-10 23:50:28,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ba1c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:50:28, skipping insertion in model container [2024-10-10 23:50:28,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:50:23" (2/3) ... [2024-10-10 23:50:28,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8ba1c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:50:28, skipping insertion in model container [2024-10-10 23:50:28,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:50:28" (3/3) ... [2024-10-10 23:50:28,016 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label03.c [2024-10-10 23:50:28,033 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:50:28,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:50:28,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:50:28,137 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;@644ac2d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:50:28,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:50:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 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-10-10 23:50:28,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 23:50:28,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:28,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:28,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:28,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1849928806, now seen corresponding path program 1 times [2024-10-10 23:50:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690178181] [2024-10-10 23:50:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:28,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690178181] [2024-10-10 23:50:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690178181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:28,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907104541] [2024-10-10 23:50:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:28,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:50:28,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:50:28,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:50:28,371 INFO L87 Difference]: Start difference. First operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) 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-10-10 23:50:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:28,470 INFO L93 Difference]: Finished difference Result 1389 states and 2763 transitions. [2024-10-10 23:50:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:50:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) 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-10-10 23:50:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:28,494 INFO L225 Difference]: With dead ends: 1389 [2024-10-10 23:50:28,494 INFO L226 Difference]: Without dead ends: 693 [2024-10-10 23:50:28,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:50:28,503 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:28,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:50:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-10 23:50:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-10 23:50:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 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-10-10 23:50:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2024-10-10 23:50:28,569 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 10 [2024-10-10 23:50:28,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:28,570 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2024-10-10 23:50:28,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) 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-10-10 23:50:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2024-10-10 23:50:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 23:50:28,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:28,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:28,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:50:28,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1946409882, now seen corresponding path program 1 times [2024-10-10 23:50:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576203357] [2024-10-10 23:50:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:28,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576203357] [2024-10-10 23:50:28,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576203357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:28,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:28,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801806764] [2024-10-10 23:50:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:28,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:28,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:28,707 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. 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-10-10 23:50:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:31,417 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2024-10-10 23:50:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:31,418 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-10-10 23:50:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:31,424 INFO L225 Difference]: With dead ends: 2075 [2024-10-10 23:50:31,424 INFO L226 Difference]: Without dead ends: 1383 [2024-10-10 23:50:31,425 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-10-10 23:50:31,427 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 701 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:31,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 465 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:50:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-10-10 23:50:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2024-10-10 23:50:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5781476121562952) internal successors, (2181), 1382 states have internal predecessors, (2181), 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-10-10 23:50:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2181 transitions. [2024-10-10 23:50:31,501 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2181 transitions. Word has length 10 [2024-10-10 23:50:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:31,501 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2181 transitions. [2024-10-10 23:50:31,501 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-10-10 23:50:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2181 transitions. [2024-10-10 23:50:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-10 23:50:31,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:31,504 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:50:31,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:50:31,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:31,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -850746212, now seen corresponding path program 1 times [2024-10-10 23:50:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041314000] [2024-10-10 23:50:31,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:31,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041314000] [2024-10-10 23:50:31,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041314000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:31,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:31,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:31,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95096537] [2024-10-10 23:50:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:31,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:31,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:31,777 INFO L87 Difference]: Start difference. First operand 1383 states and 2181 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-10-10 23:50:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:34,657 INFO L93 Difference]: Finished difference Result 4145 states and 6540 transitions. [2024-10-10 23:50:34,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:34,658 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-10-10 23:50:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:34,667 INFO L225 Difference]: With dead ends: 4145 [2024-10-10 23:50:34,667 INFO L226 Difference]: Without dead ends: 2763 [2024-10-10 23:50:34,669 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-10-10 23:50:34,672 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 713 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:34,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 527 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:50:34,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2024-10-10 23:50:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2024-10-10 23:50:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3482983345401882) internal successors, (3724), 2762 states have internal predecessors, (3724), 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-10-10 23:50:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3724 transitions. [2024-10-10 23:50:34,724 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3724 transitions. Word has length 76 [2024-10-10 23:50:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:34,725 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3724 transitions. [2024-10-10 23:50:34,725 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-10-10 23:50:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3724 transitions. [2024-10-10 23:50:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-10 23:50:34,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:34,728 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:50:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:50:34,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:34,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash -996766258, now seen corresponding path program 1 times [2024-10-10 23:50:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447364711] [2024-10-10 23:50:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:34,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447364711] [2024-10-10 23:50:34,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447364711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:34,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:34,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:50:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295684473] [2024-10-10 23:50:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:34,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:34,880 INFO L87 Difference]: Start difference. First operand 2763 states and 3724 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-10-10 23:50:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:37,191 INFO L93 Difference]: Finished difference Result 8287 states and 11170 transitions. [2024-10-10 23:50:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:37,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2024-10-10 23:50:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:37,211 INFO L225 Difference]: With dead ends: 8287 [2024-10-10 23:50:37,211 INFO L226 Difference]: Without dead ends: 5525 [2024-10-10 23:50:37,218 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-10-10 23:50:37,220 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:37,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 432 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:50:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2024-10-10 23:50:37,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5523. [2024-10-10 23:50:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 1.2299891343716045) internal successors, (6792), 5522 states have internal predecessors, (6792), 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-10-10 23:50:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 6792 transitions. [2024-10-10 23:50:37,312 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 6792 transitions. Word has length 96 [2024-10-10 23:50:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:37,313 INFO L471 AbstractCegarLoop]: Abstraction has 5523 states and 6792 transitions. [2024-10-10 23:50:37,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-10-10 23:50:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 6792 transitions. [2024-10-10 23:50:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-10 23:50:37,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:37,317 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:50:37,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:50:37,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:37,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1619323987, now seen corresponding path program 1 times [2024-10-10 23:50:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:37,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190574716] [2024-10-10 23:50:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190574716] [2024-10-10 23:50:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190574716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183994503] [2024-10-10 23:50:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:37,471 INFO L87 Difference]: Start difference. First operand 5523 states and 6792 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-10-10 23:50:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:39,947 INFO L93 Difference]: Finished difference Result 15875 states and 19665 transitions. [2024-10-10 23:50:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2024-10-10 23:50:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:39,977 INFO L225 Difference]: With dead ends: 15875 [2024-10-10 23:50:39,977 INFO L226 Difference]: Without dead ends: 10353 [2024-10-10 23:50:39,983 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-10-10 23:50:39,986 INFO L432 NwaCegarLoop]: 1301 mSDtfsCounter, 682 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:39,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1307 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:50:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10353 states. [2024-10-10 23:50:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10353 to 10353. [2024-10-10 23:50:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10353 states, 10352 states have (on average 1.1725270479134466) internal successors, (12138), 10352 states have internal predecessors, (12138), 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-10-10 23:50:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10353 states to 10353 states and 12138 transitions. [2024-10-10 23:50:40,144 INFO L78 Accepts]: Start accepts. Automaton has 10353 states and 12138 transitions. Word has length 103 [2024-10-10 23:50:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:40,145 INFO L471 AbstractCegarLoop]: Abstraction has 10353 states and 12138 transitions. [2024-10-10 23:50:40,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-10-10 23:50:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10353 states and 12138 transitions. [2024-10-10 23:50:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-10 23:50:40,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:40,150 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:50:40,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:50:40,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:40,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1045722654, now seen corresponding path program 1 times [2024-10-10 23:50:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:40,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069856606] [2024-10-10 23:50:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:40,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:50:40,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:40,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069856606] [2024-10-10 23:50:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069856606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:40,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:40,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:40,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204144590] [2024-10-10 23:50:40,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:40,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:40,311 INFO L87 Difference]: Start difference. First operand 10353 states and 12138 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-10-10 23:50:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:42,785 INFO L93 Difference]: Finished difference Result 26225 states and 31065 transitions. [2024-10-10 23:50:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 128 [2024-10-10 23:50:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:42,828 INFO L225 Difference]: With dead ends: 26225 [2024-10-10 23:50:42,828 INFO L226 Difference]: Without dead ends: 15873 [2024-10-10 23:50:42,839 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-10-10 23:50:42,839 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 712 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:42,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 146 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:50:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15873 states. [2024-10-10 23:50:43,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15873 to 15183. [2024-10-10 23:50:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15183 states, 15182 states have (on average 1.1840337241470162) internal successors, (17976), 15182 states have internal predecessors, (17976), 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-10-10 23:50:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15183 states to 15183 states and 17976 transitions. [2024-10-10 23:50:43,097 INFO L78 Accepts]: Start accepts. Automaton has 15183 states and 17976 transitions. Word has length 128 [2024-10-10 23:50:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:43,100 INFO L471 AbstractCegarLoop]: Abstraction has 15183 states and 17976 transitions. [2024-10-10 23:50:43,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-10-10 23:50:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15183 states and 17976 transitions. [2024-10-10 23:50:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-10-10 23:50:43,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:43,107 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:43,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:50:43,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1884743775, now seen corresponding path program 1 times [2024-10-10 23:50:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381049812] [2024-10-10 23:50:43,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:43,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-10 23:50:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:43,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381049812] [2024-10-10 23:50:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381049812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:43,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:43,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:43,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786517726] [2024-10-10 23:50:43,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:43,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:50:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:43,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:50:43,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:50:43,765 INFO L87 Difference]: Start difference. First operand 15183 states and 17976 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-10-10 23:50:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:46,739 INFO L93 Difference]: Finished difference Result 32435 states and 38141 transitions. [2024-10-10 23:50:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:50:46,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 267 [2024-10-10 23:50:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:46,768 INFO L225 Difference]: With dead ends: 32435 [2024-10-10 23:50:46,768 INFO L226 Difference]: Without dead ends: 17253 [2024-10-10 23:50:46,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:50:46,778 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 4113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:46,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 638 Invalid, 4113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:50:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17253 states. [2024-10-10 23:50:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17253 to 17253. [2024-10-10 23:50:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17253 states, 17252 states have (on average 1.167169023881289) internal successors, (20136), 17252 states have internal predecessors, (20136), 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-10-10 23:50:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17253 states to 17253 states and 20136 transitions. [2024-10-10 23:50:46,993 INFO L78 Accepts]: Start accepts. Automaton has 17253 states and 20136 transitions. Word has length 267 [2024-10-10 23:50:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 17253 states and 20136 transitions. [2024-10-10 23:50:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-10-10 23:50:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 17253 states and 20136 transitions. [2024-10-10 23:50:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-10 23:50:46,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:46,999 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:50:47,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:50:47,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:47,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -803197825, now seen corresponding path program 1 times [2024-10-10 23:50:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102662428] [2024-10-10 23:50:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:47,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-10 23:50:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102662428] [2024-10-10 23:50:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102662428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:47,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:47,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721533411] [2024-10-10 23:50:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:47,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:47,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:47,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:47,412 INFO L87 Difference]: Start difference. First operand 17253 states and 20136 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-10-10 23:50:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:49,910 INFO L93 Difference]: Finished difference Result 42095 states and 49911 transitions. [2024-10-10 23:50:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:49,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 395 [2024-10-10 23:50:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:49,962 INFO L225 Difference]: With dead ends: 42095 [2024-10-10 23:50:49,962 INFO L226 Difference]: Without dead ends: 24843 [2024-10-10 23:50:49,982 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-10-10 23:50:49,983 INFO L432 NwaCegarLoop]: 1303 mSDtfsCounter, 682 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:49,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1309 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:50:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24843 states. [2024-10-10 23:50:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24843 to 24153. [2024-10-10 23:50:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24153 states, 24152 states have (on average 1.1395329579330904) internal successors, (27522), 24152 states have internal predecessors, (27522), 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-10-10 23:50:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24153 states to 24153 states and 27522 transitions. [2024-10-10 23:50:50,456 INFO L78 Accepts]: Start accepts. Automaton has 24153 states and 27522 transitions. Word has length 395 [2024-10-10 23:50:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:50,458 INFO L471 AbstractCegarLoop]: Abstraction has 24153 states and 27522 transitions. [2024-10-10 23:50:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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-10-10 23:50:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 24153 states and 27522 transitions. [2024-10-10 23:50:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-10-10 23:50:50,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:50,481 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:50:50,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:50:50,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:50,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:50,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1291194631, now seen corresponding path program 1 times [2024-10-10 23:50:50,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:50,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229650551] [2024-10-10 23:50:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:50,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:50:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229650551] [2024-10-10 23:50:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229650551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720539005] [2024-10-10 23:50:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:51,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:50:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:51,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:50:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:50:51,166 INFO L87 Difference]: Start difference. First operand 24153 states and 27522 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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-10-10 23:50:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:53,534 INFO L93 Difference]: Finished difference Result 51118 states and 57910 transitions. [2024-10-10 23:50:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:50:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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 449 [2024-10-10 23:50:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:53,585 INFO L225 Difference]: With dead ends: 51118 [2024-10-10 23:50:53,585 INFO L226 Difference]: Without dead ends: 26913 [2024-10-10 23:50:53,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:50:53,612 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 529 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:53,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 634 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:50:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26913 states. [2024-10-10 23:50:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26913 to 26913. [2024-10-10 23:50:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26913 states, 26912 states have (on average 1.0949390606420928) internal successors, (29467), 26912 states have internal predecessors, (29467), 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-10-10 23:50:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26913 states to 26913 states and 29467 transitions. [2024-10-10 23:50:53,994 INFO L78 Accepts]: Start accepts. Automaton has 26913 states and 29467 transitions. Word has length 449 [2024-10-10 23:50:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:53,994 INFO L471 AbstractCegarLoop]: Abstraction has 26913 states and 29467 transitions. [2024-10-10 23:50:53,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 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-10-10 23:50:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 26913 states and 29467 transitions. [2024-10-10 23:50:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-10-10 23:50:54,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:54,003 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:50:54,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:50:54,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash -304431290, now seen corresponding path program 1 times [2024-10-10 23:50:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277239021] [2024-10-10 23:50:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:54,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-10-10 23:50:54,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:54,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277239021] [2024-10-10 23:50:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277239021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:54,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:54,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602920832] [2024-10-10 23:50:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:54,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:54,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:54,587 INFO L87 Difference]: Start difference. First operand 26913 states and 29467 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-10-10 23:50:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:56,687 INFO L93 Difference]: Finished difference Result 60725 states and 67404 transitions. [2024-10-10 23:50:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:50:56,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 480 [2024-10-10 23:50:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:56,722 INFO L225 Difference]: With dead ends: 60725 [2024-10-10 23:50:56,723 INFO L226 Difference]: Without dead ends: 31053 [2024-10-10 23:50:56,748 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-10-10 23:50:56,749 INFO L432 NwaCegarLoop]: 1126 mSDtfsCounter, 687 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:56,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1132 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:50:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31053 states. [2024-10-10 23:50:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31053 to 31053. [2024-10-10 23:50:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31053 states, 31052 states have (on average 1.0912984670874661) internal successors, (33887), 31052 states have internal predecessors, (33887), 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-10-10 23:50:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31053 states to 31053 states and 33887 transitions. [2024-10-10 23:50:57,178 INFO L78 Accepts]: Start accepts. Automaton has 31053 states and 33887 transitions. Word has length 480 [2024-10-10 23:50:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:57,179 INFO L471 AbstractCegarLoop]: Abstraction has 31053 states and 33887 transitions. [2024-10-10 23:50:57,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-10-10 23:50:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 31053 states and 33887 transitions. [2024-10-10 23:50:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-10-10 23:50:57,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:57,188 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:50:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:50:57,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:57,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:57,189 INFO L85 PathProgramCache]: Analyzing trace with hash -992244913, now seen corresponding path program 1 times [2024-10-10 23:50:57,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436166711] [2024-10-10 23:50:57,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 23:50:58,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:58,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436166711] [2024-10-10 23:50:58,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436166711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:50:58,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:50:58,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:50:58,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915937267] [2024-10-10 23:50:58,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:50:58,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:50:58,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:50:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:50:58,103 INFO L87 Difference]: Start difference. First operand 31053 states and 33887 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-10-10 23:51:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:00,081 INFO L93 Difference]: Finished difference Result 66935 states and 73402 transitions. [2024-10-10 23:51:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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 497 [2024-10-10 23:51:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:00,120 INFO L225 Difference]: With dead ends: 66935 [2024-10-10 23:51:00,120 INFO L226 Difference]: Without dead ends: 35883 [2024-10-10 23:51:00,139 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-10-10 23:51:00,140 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 574 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:00,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 971 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:51:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35883 states. [2024-10-10 23:51:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35883 to 35193. [2024-10-10 23:51:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35193 states, 35192 states have (on average 1.0884291884519208) internal successors, (38304), 35192 states have internal predecessors, (38304), 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-10-10 23:51:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35193 states to 35193 states and 38304 transitions. [2024-10-10 23:51:00,478 INFO L78 Accepts]: Start accepts. Automaton has 35193 states and 38304 transitions. Word has length 497 [2024-10-10 23:51:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:00,479 INFO L471 AbstractCegarLoop]: Abstraction has 35193 states and 38304 transitions. [2024-10-10 23:51:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-10-10 23:51:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 35193 states and 38304 transitions. [2024-10-10 23:51:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-10-10 23:51:00,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:00,484 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:00,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:51:00,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:00,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1339652182, now seen corresponding path program 1 times [2024-10-10 23:51:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796434135] [2024-10-10 23:51:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 149 proven. 32 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-10 23:51:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:01,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796434135] [2024-10-10 23:51:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796434135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:51:01,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738694610] [2024-10-10 23:51:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:01,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:01,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:51:01,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:51:01,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:51:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:01,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:51:01,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:51:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-10 23:51:01,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:51:01,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738694610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:01,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:51:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:51:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85461567] [2024-10-10 23:51:01,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:01,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:01,543 INFO L87 Difference]: Start difference. First operand 35193 states and 38304 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-10-10 23:51:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:03,567 INFO L93 Difference]: Finished difference Result 80735 states and 89052 transitions. [2024-10-10 23:51:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 504 [2024-10-10 23:51:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:03,622 INFO L225 Difference]: With dead ends: 80735 [2024-10-10 23:51:03,622 INFO L226 Difference]: Without dead ends: 46233 [2024-10-10 23:51:03,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:03,645 INFO L432 NwaCegarLoop]: 1078 mSDtfsCounter, 706 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:03,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1084 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:51:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46233 states. [2024-10-10 23:51:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46233 to 46233. [2024-10-10 23:51:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46233 states, 46232 states have (on average 1.0801609274961066) internal successors, (49938), 46232 states have internal predecessors, (49938), 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-10-10 23:51:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46233 states to 46233 states and 49938 transitions. [2024-10-10 23:51:04,226 INFO L78 Accepts]: Start accepts. Automaton has 46233 states and 49938 transitions. Word has length 504 [2024-10-10 23:51:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:04,227 INFO L471 AbstractCegarLoop]: Abstraction has 46233 states and 49938 transitions. [2024-10-10 23:51:04,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-10-10 23:51:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 46233 states and 49938 transitions. [2024-10-10 23:51:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2024-10-10 23:51:04,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:04,345 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:04,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:51:04,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:51:04,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:04,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash 536246925, now seen corresponding path program 1 times [2024-10-10 23:51:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816975565] [2024-10-10 23:51:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 386 proven. 32 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:51:05,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816975565] [2024-10-10 23:51:05,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816975565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:51:05,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058213662] [2024-10-10 23:51:05,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:05,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:51:05,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:51:05,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:51:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:05,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:51:05,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:51:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-10-10 23:51:05,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:51:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058213662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:51:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:51:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570930179] [2024-10-10 23:51:05,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:05,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:05,590 INFO L87 Difference]: Start difference. First operand 46233 states and 49938 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-10 23:51:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:07,627 INFO L93 Difference]: Finished difference Result 100055 states and 108615 transitions. [2024-10-10 23:51:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 588 [2024-10-10 23:51:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:07,685 INFO L225 Difference]: With dead ends: 100055 [2024-10-10 23:51:07,685 INFO L226 Difference]: Without dead ends: 54513 [2024-10-10 23:51:07,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 588 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:51:07,713 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 702 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 668 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:07,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 116 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:51:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54513 states. [2024-10-10 23:51:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54513 to 50373. [2024-10-10 23:51:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50373 states, 50372 states have (on average 1.0905463352656237) internal successors, (54933), 50372 states have internal predecessors, (54933), 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-10-10 23:51:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50373 states to 50373 states and 54933 transitions. [2024-10-10 23:51:08,384 INFO L78 Accepts]: Start accepts. Automaton has 50373 states and 54933 transitions. Word has length 588 [2024-10-10 23:51:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:08,385 INFO L471 AbstractCegarLoop]: Abstraction has 50373 states and 54933 transitions. [2024-10-10 23:51:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-10-10 23:51:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 50373 states and 54933 transitions. [2024-10-10 23:51:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2024-10-10 23:51:08,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:08,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:08,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:51:08,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:08,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:08,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 99634799, now seen corresponding path program 1 times [2024-10-10 23:51:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:08,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141660954] [2024-10-10 23:51:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 291 proven. 117 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 23:51:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141660954] [2024-10-10 23:51:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141660954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:51:10,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992129756] [2024-10-10 23:51:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:51:10,101 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:51:10,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:51:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:10,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:51:10,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:51:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-10 23:51:10,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:51:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992129756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:51:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:51:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813871528] [2024-10-10 23:51:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:10,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:51:10,498 INFO L87 Difference]: Start difference. First operand 50373 states and 54933 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-10-10 23:51:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:12,649 INFO L93 Difference]: Finished difference Result 100055 states and 109172 transitions. [2024-10-10 23:51:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:12,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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 591 [2024-10-10 23:51:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:12,705 INFO L225 Difference]: With dead ends: 100055 [2024-10-10 23:51:12,705 INFO L226 Difference]: Without dead ends: 50373 [2024-10-10 23:51:12,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:51:12,727 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 625 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:12,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 163 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:51:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50373 states. [2024-10-10 23:51:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50373 to 49683. [2024-10-10 23:51:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49683 states, 49682 states have (on average 1.07095124994968) internal successors, (53207), 49682 states have internal predecessors, (53207), 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-10-10 23:51:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49683 states to 49683 states and 53207 transitions. [2024-10-10 23:51:13,341 INFO L78 Accepts]: Start accepts. Automaton has 49683 states and 53207 transitions. Word has length 591 [2024-10-10 23:51:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:13,341 INFO L471 AbstractCegarLoop]: Abstraction has 49683 states and 53207 transitions. [2024-10-10 23:51:13,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-10-10 23:51:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49683 states and 53207 transitions. [2024-10-10 23:51:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-10-10 23:51:13,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:13,351 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:13,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:51:13,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:51:13,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:13,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1938753393, now seen corresponding path program 1 times [2024-10-10 23:51:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517695823] [2024-10-10 23:51:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:13,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-10 23:51:14,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:14,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517695823] [2024-10-10 23:51:14,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517695823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:14,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:14,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:14,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709311932] [2024-10-10 23:51:14,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:14,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:14,669 INFO L87 Difference]: Start difference. First operand 49683 states and 53207 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-10-10 23:51:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:16,562 INFO L93 Difference]: Finished difference Result 98675 states and 105720 transitions. [2024-10-10 23:51:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 625 [2024-10-10 23:51:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:16,615 INFO L225 Difference]: With dead ends: 98675 [2024-10-10 23:51:16,615 INFO L226 Difference]: Without dead ends: 49683 [2024-10-10 23:51:16,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:16,639 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 786 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:16,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 777 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:51:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49683 states. [2024-10-10 23:51:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49683 to 49683. [2024-10-10 23:51:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49683 states, 49682 states have (on average 1.0601425063403245) internal successors, (52670), 49682 states have internal predecessors, (52670), 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-10-10 23:51:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49683 states to 49683 states and 52670 transitions. [2024-10-10 23:51:17,444 INFO L78 Accepts]: Start accepts. Automaton has 49683 states and 52670 transitions. Word has length 625 [2024-10-10 23:51:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:17,445 INFO L471 AbstractCegarLoop]: Abstraction has 49683 states and 52670 transitions. [2024-10-10 23:51:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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-10-10 23:51:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 49683 states and 52670 transitions. [2024-10-10 23:51:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-10-10 23:51:17,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:17,455 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:17,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:51:17,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:17,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1741567590, now seen corresponding path program 1 times [2024-10-10 23:51:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:17,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125913791] [2024-10-10 23:51:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-10 23:51:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125913791] [2024-10-10 23:51:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125913791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:17,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367839468] [2024-10-10 23:51:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:17,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:17,832 INFO L87 Difference]: Start difference. First operand 49683 states and 52670 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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-10-10 23:51:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:19,923 INFO L93 Difference]: Finished difference Result 109715 states and 117250 transitions. [2024-10-10 23:51:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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 660 [2024-10-10 23:51:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:19,981 INFO L225 Difference]: With dead ends: 109715 [2024-10-10 23:51:19,981 INFO L226 Difference]: Without dead ends: 56583 [2024-10-10 23:51:20,015 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-10-10 23:51:20,016 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 653 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:20,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1055 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:51:20,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56583 states. [2024-10-10 23:51:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56583 to 53133. [2024-10-10 23:51:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53133 states, 53132 states have (on average 1.0370962884890462) internal successors, (55103), 53132 states have internal predecessors, (55103), 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-10-10 23:51:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53133 states to 53133 states and 55103 transitions. [2024-10-10 23:51:20,609 INFO L78 Accepts]: Start accepts. Automaton has 53133 states and 55103 transitions. Word has length 660 [2024-10-10 23:51:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:20,610 INFO L471 AbstractCegarLoop]: Abstraction has 53133 states and 55103 transitions. [2024-10-10 23:51:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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-10-10 23:51:20,610 INFO L276 IsEmpty]: Start isEmpty. Operand 53133 states and 55103 transitions. [2024-10-10 23:51:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2024-10-10 23:51:20,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:20,619 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:20,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:51:20,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:20,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -957790791, now seen corresponding path program 1 times [2024-10-10 23:51:20,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:20,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626497417] [2024-10-10 23:51:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-10 23:51:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626497417] [2024-10-10 23:51:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626497417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:21,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870157884] [2024-10-10 23:51:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:21,228 INFO L87 Difference]: Start difference. First operand 53133 states and 55103 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-10-10 23:51:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:23,209 INFO L93 Difference]: Finished difference Result 129035 states and 134107 transitions. [2024-10-10 23:51:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:23,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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 743 [2024-10-10 23:51:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:23,292 INFO L225 Difference]: With dead ends: 129035 [2024-10-10 23:51:23,292 INFO L226 Difference]: Without dead ends: 75903 [2024-10-10 23:51:23,323 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-10-10 23:51:23,324 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 574 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:23,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 112 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:51:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75903 states. [2024-10-10 23:51:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75903 to 74523. [2024-10-10 23:51:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74523 states, 74522 states have (on average 1.0373580955959314) internal successors, (77306), 74522 states have internal predecessors, (77306), 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-10-10 23:51:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74523 states to 74523 states and 77306 transitions. [2024-10-10 23:51:24,329 INFO L78 Accepts]: Start accepts. Automaton has 74523 states and 77306 transitions. Word has length 743 [2024-10-10 23:51:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:24,329 INFO L471 AbstractCegarLoop]: Abstraction has 74523 states and 77306 transitions. [2024-10-10 23:51:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-10-10 23:51:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 74523 states and 77306 transitions. [2024-10-10 23:51:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2024-10-10 23:51:24,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:24,354 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:51:24,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:51:24,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 892048021, now seen corresponding path program 1 times [2024-10-10 23:51:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87092615] [2024-10-10 23:51:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-10 23:51:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:25,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87092615] [2024-10-10 23:51:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87092615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:25,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191526893] [2024-10-10 23:51:25,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:25,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:25,063 INFO L87 Difference]: Start difference. First operand 74523 states and 77306 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-10-10 23:51:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:27,066 INFO L93 Difference]: Finished difference Result 149045 states and 154560 transitions. [2024-10-10 23:51:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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 957 [2024-10-10 23:51:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:27,137 INFO L225 Difference]: With dead ends: 149045 [2024-10-10 23:51:27,137 INFO L226 Difference]: Without dead ends: 70383 [2024-10-10 23:51:27,154 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-10-10 23:51:27,154 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 542 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:27,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 932 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:51:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70383 states. [2024-10-10 23:51:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70383 to 68313. [2024-10-10 23:51:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68313 states, 68312 states have (on average 1.0208016161142992) internal successors, (69733), 68312 states have internal predecessors, (69733), 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-10-10 23:51:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68313 states to 68313 states and 69733 transitions. [2024-10-10 23:51:28,051 INFO L78 Accepts]: Start accepts. Automaton has 68313 states and 69733 transitions. Word has length 957 [2024-10-10 23:51:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:28,052 INFO L471 AbstractCegarLoop]: Abstraction has 68313 states and 69733 transitions. [2024-10-10 23:51:28,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-10-10 23:51:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68313 states and 69733 transitions. [2024-10-10 23:51:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2024-10-10 23:51:28,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:28,103 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:28,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:51:28,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:28,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash -266613311, now seen corresponding path program 1 times [2024-10-10 23:51:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:28,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437363486] [2024-10-10 23:51:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:28,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 756 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-10 23:51:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437363486] [2024-10-10 23:51:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437363486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:29,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:29,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:29,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442313209] [2024-10-10 23:51:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:29,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:29,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:29,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:29,174 INFO L87 Difference]: Start difference. First operand 68313 states and 69733 transitions. Second operand has 3 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 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-10-10 23:51:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:51:30,981 INFO L93 Difference]: Finished difference Result 156635 states and 159956 transitions. [2024-10-10 23:51:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:51:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 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 1113 [2024-10-10 23:51:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:51:31,072 INFO L225 Difference]: With dead ends: 156635 [2024-10-10 23:51:31,072 INFO L226 Difference]: Without dead ends: 88323 [2024-10-10 23:51:31,352 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-10-10 23:51:31,352 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 617 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:51:31,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 225 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:51:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88323 states. [2024-10-10 23:51:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88323 to 86943. [2024-10-10 23:51:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86943 states, 86942 states have (on average 1.019610774999425) internal successors, (88647), 86942 states have internal predecessors, (88647), 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-10-10 23:51:32,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86943 states to 86943 states and 88647 transitions. [2024-10-10 23:51:32,383 INFO L78 Accepts]: Start accepts. Automaton has 86943 states and 88647 transitions. Word has length 1113 [2024-10-10 23:51:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:51:32,383 INFO L471 AbstractCegarLoop]: Abstraction has 86943 states and 88647 transitions. [2024-10-10 23:51:32,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 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-10-10 23:51:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 86943 states and 88647 transitions. [2024-10-10 23:51:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1253 [2024-10-10 23:51:32,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:51:32,433 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 23:51:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:51:32,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:51:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:51:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash -298799361, now seen corresponding path program 1 times [2024-10-10 23:51:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:51:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912575164] [2024-10-10 23:51:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:51:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:51:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:51:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1494 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-10-10 23:51:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:51:34,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912575164] [2024-10-10 23:51:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912575164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:51:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:51:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:51:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596546033] [2024-10-10 23:51:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:51:34,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:51:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:51:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:51:34,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:51:34,128 INFO L87 Difference]: Start difference. First operand 86943 states and 88647 transitions. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 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)