./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/Problem13_label01.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/Problem13_label01.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 500fb51493d30e1b316117b24f5b2ae67d8f35b2c1172c5ed38f45dce818927e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:25:59,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:25:59,962 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:25:59,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:25:59,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:25:59,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:25:59,997 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:25:59,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:25:59,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:26:00,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:26:00,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:26:00,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:26:00,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:26:00,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:26:00,004 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:26:00,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:26:00,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:26:00,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:26:00,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:26:00,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:26:00,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:26:00,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:26:00,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:26:00,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:26:00,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:26:00,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:26:00,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:26:00,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:26:00,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:26:00,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:26:00,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:26:00,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:26:00,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:26:00,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:26:00,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:26:00,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:26:00,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:26:00,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:26:00,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:26:00,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:26:00,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:26:00,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:26:00,013 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 -> 500fb51493d30e1b316117b24f5b2ae67d8f35b2c1172c5ed38f45dce818927e [2024-10-10 23:26:00,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:26:00,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:26:00,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:26:00,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:26:00,345 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:26:00,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label01.c [2024-10-10 23:26:01,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:26:02,334 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:26:02,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label01.c [2024-10-10 23:26:02,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7782be95/73b25a0d992b4bc4b74a196fc62a6cfe/FLAG1828eb68f [2024-10-10 23:26:02,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c7782be95/73b25a0d992b4bc4b74a196fc62a6cfe [2024-10-10 23:26:02,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:26:02,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:26:02,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:26:02,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:26:02,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:26:02,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:26:02" (1/1) ... [2024-10-10 23:26:02,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb94196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:02, skipping insertion in model container [2024-10-10 23:26:02,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:26:02" (1/1) ... [2024-10-10 23:26:03,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:26:03,349 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/Problem13_label01.c[7003,7016] [2024-10-10 23:26:04,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:26:04,187 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:26:04,218 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/Problem13_label01.c[7003,7016] [2024-10-10 23:26:04,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:26:04,653 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:26:04,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04 WrapperNode [2024-10-10 23:26:04,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:26:04,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:26:04,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:26:04,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:26:04,662 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:26:04" (1/1) ... [2024-10-10 23:26:04,739 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:26:04" (1/1) ... [2024-10-10 23:26:05,359 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:26:05,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:26:05,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:26:05,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:26:05,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:26:05,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:05,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:05,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,011 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:26:06,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:26:06,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:26:06,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:26:06,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:26:06,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (1/1) ... [2024-10-10 23:26:06,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:26:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:26:06,638 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:26:06,640 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:26:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:26:06,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:26:06,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:26:06,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:26:06,826 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:26:06,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:26:13,052 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:26:13,053 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:26:13,133 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:26:13,133 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:26:13,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:26:13 BoogieIcfgContainer [2024-10-10 23:26:13,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:26:13,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:26:13,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:26:13,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:26:13,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:26:02" (1/3) ... [2024-10-10 23:26:13,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1530ec42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:26:13, skipping insertion in model container [2024-10-10 23:26:13,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:04" (2/3) ... [2024-10-10 23:26:13,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1530ec42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:26:13, skipping insertion in model container [2024-10-10 23:26:13,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:26:13" (3/3) ... [2024-10-10 23:26:13,145 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label01.c [2024-10-10 23:26:13,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:26:13,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:26:13,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:26:13,271 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;@6a72d5b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:26:13,271 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:26:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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:26:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 23:26:13,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:13,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:13,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1855441611, now seen corresponding path program 1 times [2024-10-10 23:26:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376279539] [2024-10-10 23:26:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:13,513 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:26:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:13,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376279539] [2024-10-10 23:26:13,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376279539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:13,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:13,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:26:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290493163] [2024-10-10 23:26:13,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:26:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:13,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:26:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:26:13,562 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:26:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:13,679 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:26:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:26:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-10 23:26:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:13,706 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:26:13,706 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:26:13,714 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:26:13,719 INFO L432 NwaCegarLoop]: 1876 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, 1876 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:26:13,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:26:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:26:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:26:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 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:26:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:26:13,822 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 48 [2024-10-10 23:26:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:26:13,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:26:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:26:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 23:26:13,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:13,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:26:13,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:26:13,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1368389808, now seen corresponding path program 1 times [2024-10-10 23:26:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775220005] [2024-10-10 23:26:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:14,044 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:26:14,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:14,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775220005] [2024-10-10 23:26:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775220005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:26:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649456178] [2024-10-10 23:26:14,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:14,048 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:26:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:17,874 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2024-10-10 23:26:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-10 23:26:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:17,883 INFO L225 Difference]: With dead ends: 2931 [2024-10-10 23:26:17,883 INFO L226 Difference]: Without dead ends: 1898 [2024-10-10 23:26:17,887 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:26:17,889 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 966 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:17,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 594 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-10 23:26:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-10-10 23:26:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2024-10-10 23:26:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 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:26:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2024-10-10 23:26:17,947 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 48 [2024-10-10 23:26:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2024-10-10 23:26:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:26:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2024-10-10 23:26:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 23:26:17,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:17,954 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:26:17,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:26:17,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:17,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash -250112357, now seen corresponding path program 1 times [2024-10-10 23:26:17,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:17,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604341752] [2024-10-10 23:26:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:17,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:26:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604341752] [2024-10-10 23:26:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604341752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:18,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:26:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389203267] [2024-10-10 23:26:18,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:18,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:18,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:18,219 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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:26:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:21,908 INFO L93 Difference]: Finished difference Result 5383 states and 9440 transitions. [2024-10-10 23:26:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-10 23:26:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:21,924 INFO L225 Difference]: With dead ends: 5383 [2024-10-10 23:26:21,924 INFO L226 Difference]: Without dead ends: 3491 [2024-10-10 23:26:21,929 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:26:21,930 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:21,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1011 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-10 23:26:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2024-10-10 23:26:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3490. [2024-10-10 23:26:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5385497277156779) internal successors, (5368), 3489 states have internal predecessors, (5368), 0 states have call successors, (0), 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:26:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5368 transitions. [2024-10-10 23:26:22,020 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5368 transitions. Word has length 113 [2024-10-10 23:26:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:22,021 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5368 transitions. [2024-10-10 23:26:22,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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:26:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5368 transitions. [2024-10-10 23:26:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:26:22,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:22,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:26:22,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:26:22,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:22,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2135920896, now seen corresponding path program 1 times [2024-10-10 23:26:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453379752] [2024-10-10 23:26:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:22,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:26:22,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453379752] [2024-10-10 23:26:22,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453379752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:22,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:22,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:26:22,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986720668] [2024-10-10 23:26:22,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:22,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:22,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:22,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:22,276 INFO L87 Difference]: Start difference. First operand 3490 states and 5368 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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:26:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:25,494 INFO L93 Difference]: Finished difference Result 10168 states and 15699 transitions. [2024-10-10 23:26:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-10 23:26:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:25,519 INFO L225 Difference]: With dead ends: 10168 [2024-10-10 23:26:25,519 INFO L226 Difference]: Without dead ends: 6679 [2024-10-10 23:26:25,525 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:26:25,526 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:25,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 845 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:26:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-10 23:26:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6668. [2024-10-10 23:26:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.3752812359382032) internal successors, (9169), 6667 states have internal predecessors, (9169), 0 states have call successors, (0), 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:26:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9169 transitions. [2024-10-10 23:26:25,657 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9169 transitions. Word has length 115 [2024-10-10 23:26:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:25,660 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 9169 transitions. [2024-10-10 23:26:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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:26:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9169 transitions. [2024-10-10 23:26:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-10 23:26:25,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:25,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:26:25,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:25,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1815583346, now seen corresponding path program 1 times [2024-10-10 23:26:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188450542] [2024-10-10 23:26:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:26:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188450542] [2024-10-10 23:26:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188450542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:26,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:26,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:26:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079352453] [2024-10-10 23:26:26,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:26,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:26,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:26,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:26,097 INFO L87 Difference]: Start difference. First operand 6668 states and 9169 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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:26:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:28,916 INFO L93 Difference]: Finished difference Result 14122 states and 19184 transitions. [2024-10-10 23:26:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-10-10 23:26:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:28,947 INFO L225 Difference]: With dead ends: 14122 [2024-10-10 23:26:28,947 INFO L226 Difference]: Without dead ends: 7455 [2024-10-10 23:26:28,956 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:26:28,957 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:28,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1213 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:26:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2024-10-10 23:26:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2024-10-10 23:26:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3363294875234772) internal successors, (9961), 7454 states have internal predecessors, (9961), 0 states have call successors, (0), 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:26:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9961 transitions. [2024-10-10 23:26:29,090 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9961 transitions. Word has length 159 [2024-10-10 23:26:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9961 transitions. [2024-10-10 23:26:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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:26:29,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9961 transitions. [2024-10-10 23:26:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-10 23:26:29,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:29,093 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:29,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:26:29,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1011256072, now seen corresponding path program 1 times [2024-10-10 23:26:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033531644] [2024-10-10 23:26:29,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:26:29,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:29,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033531644] [2024-10-10 23:26:29,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033531644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:29,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:29,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070373387] [2024-10-10 23:26:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:29,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:26:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:26:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:26:29,304 INFO L87 Difference]: Start difference. First operand 7455 states and 9961 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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:26:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:36,594 INFO L93 Difference]: Finished difference Result 26115 states and 35958 transitions. [2024-10-10 23:26:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:26:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2024-10-10 23:26:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:36,645 INFO L225 Difference]: With dead ends: 26115 [2024-10-10 23:26:36,645 INFO L226 Difference]: Without dead ends: 19448 [2024-10-10 23:26:36,659 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:26:36,660 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 1640 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6107 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 6757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 6107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:36,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1068 Invalid, 6757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 6107 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-10-10 23:26:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19448 states. [2024-10-10 23:26:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19448 to 19302. [2024-10-10 23:26:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19302 states, 19301 states have (on average 1.2778612507123983) internal successors, (24664), 19301 states have internal predecessors, (24664), 0 states have call successors, (0), 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:26:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19302 states to 19302 states and 24664 transitions. [2024-10-10 23:26:36,966 INFO L78 Accepts]: Start accepts. Automaton has 19302 states and 24664 transitions. Word has length 173 [2024-10-10 23:26:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:36,967 INFO L471 AbstractCegarLoop]: Abstraction has 19302 states and 24664 transitions. [2024-10-10 23:26:36,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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:26:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 19302 states and 24664 transitions. [2024-10-10 23:26:36,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 23:26:36,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:36,972 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:26:36,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:26:36,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1823000041, now seen corresponding path program 1 times [2024-10-10 23:26:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:36,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712483434] [2024-10-10 23:26:36,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:36,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:26:37,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:37,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712483434] [2024-10-10 23:26:37,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712483434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:37,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:37,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:26:37,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045403690] [2024-10-10 23:26:37,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:37,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:37,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:37,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:37,410 INFO L87 Difference]: Start difference. First operand 19302 states and 24664 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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:26:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:40,305 INFO L93 Difference]: Finished difference Result 33880 states and 44170 transitions. [2024-10-10 23:26:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:40,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 260 [2024-10-10 23:26:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:40,348 INFO L225 Difference]: With dead ends: 33880 [2024-10-10 23:26:40,348 INFO L226 Difference]: Without dead ends: 19311 [2024-10-10 23:26:40,369 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:26:40,371 INFO L432 NwaCegarLoop]: 1026 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:40,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1210 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:26:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19311 states. [2024-10-10 23:26:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19311 to 19302. [2024-10-10 23:26:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19302 states, 19301 states have (on average 1.276565981037252) internal successors, (24639), 19301 states have internal predecessors, (24639), 0 states have call successors, (0), 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:26:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19302 states to 19302 states and 24639 transitions. [2024-10-10 23:26:40,779 INFO L78 Accepts]: Start accepts. Automaton has 19302 states and 24639 transitions. Word has length 260 [2024-10-10 23:26:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:40,780 INFO L471 AbstractCegarLoop]: Abstraction has 19302 states and 24639 transitions. [2024-10-10 23:26:40,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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:26:40,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19302 states and 24639 transitions. [2024-10-10 23:26:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-10 23:26:40,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:40,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:26:40,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:26:40,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:40,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1303522929, now seen corresponding path program 1 times [2024-10-10 23:26:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:40,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59189299] [2024-10-10 23:26:40,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:26:41,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59189299] [2024-10-10 23:26:41,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59189299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:41,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735071583] [2024-10-10 23:26:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:41,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:41,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:41,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:41,013 INFO L87 Difference]: Start difference. First operand 19302 states and 24639 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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:26:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:44,609 INFO L93 Difference]: Finished difference Result 51974 states and 67213 transitions. [2024-10-10 23:26:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2024-10-10 23:26:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:44,677 INFO L225 Difference]: With dead ends: 51974 [2024-10-10 23:26:44,677 INFO L226 Difference]: Without dead ends: 32673 [2024-10-10 23:26:44,705 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:26:44,709 INFO L432 NwaCegarLoop]: 1852 mSDtfsCounter, 843 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:44,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1990 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:26:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32673 states. [2024-10-10 23:26:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32673 to 31880. [2024-10-10 23:26:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31880 states, 31879 states have (on average 1.2242228426236708) internal successors, (39027), 31879 states have internal predecessors, (39027), 0 states have call successors, (0), 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:26:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31880 states to 31880 states and 39027 transitions. [2024-10-10 23:26:45,094 INFO L78 Accepts]: Start accepts. Automaton has 31880 states and 39027 transitions. Word has length 262 [2024-10-10 23:26:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:45,095 INFO L471 AbstractCegarLoop]: Abstraction has 31880 states and 39027 transitions. [2024-10-10 23:26:45,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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:26:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31880 states and 39027 transitions. [2024-10-10 23:26:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-10-10 23:26:45,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:45,100 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:26:45,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:26:45,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:45,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:45,101 INFO L85 PathProgramCache]: Analyzing trace with hash -473975361, now seen corresponding path program 1 times [2024-10-10 23:26:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:45,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249628074] [2024-10-10 23:26:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-10 23:26:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:45,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249628074] [2024-10-10 23:26:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249628074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:45,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:26:45,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:26:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558474727] [2024-10-10 23:26:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:45,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:26:45,303 INFO L87 Difference]: Start difference. First operand 31880 states and 39027 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:26:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:48,707 INFO L93 Difference]: Finished difference Result 88167 states and 109033 transitions. [2024-10-10 23:26:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2024-10-10 23:26:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:48,788 INFO L225 Difference]: With dead ends: 88167 [2024-10-10 23:26:48,789 INFO L226 Difference]: Without dead ends: 57075 [2024-10-10 23:26:48,824 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:26:48,825 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 884 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:48,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 898 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:26:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57075 states. [2024-10-10 23:26:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57075 to 55491. [2024-10-10 23:26:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55491 states, 55490 states have (on average 1.1844296269598127) internal successors, (65724), 55490 states have internal predecessors, (65724), 0 states have call successors, (0), 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:26:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55491 states to 55491 states and 65724 transitions. [2024-10-10 23:26:49,783 INFO L78 Accepts]: Start accepts. Automaton has 55491 states and 65724 transitions. Word has length 284 [2024-10-10 23:26:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:49,786 INFO L471 AbstractCegarLoop]: Abstraction has 55491 states and 65724 transitions. [2024-10-10 23:26:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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:26:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55491 states and 65724 transitions. [2024-10-10 23:26:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-10 23:26:49,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:49,790 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:26:49,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:26:49,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:49,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1709881299, now seen corresponding path program 1 times [2024-10-10 23:26:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414273273] [2024-10-10 23:26:49,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:49,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:50,981 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 96 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:26:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414273273] [2024-10-10 23:26:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414273273] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:26:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047675214] [2024-10-10 23:26:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:50,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:26:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:26:50,986 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:26:50,988 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:26:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:51,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:26:51,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:26:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:26:51,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:26:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047675214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:26:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:26:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626714913] [2024-10-10 23:26:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:26:51,308 INFO L87 Difference]: Start difference. First operand 55491 states and 65724 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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:26:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:54,332 INFO L93 Difference]: Finished difference Result 108617 states and 128699 transitions. [2024-10-10 23:26:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 289 [2024-10-10 23:26:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:54,398 INFO L225 Difference]: With dead ends: 108617 [2024-10-10 23:26:54,398 INFO L226 Difference]: Without dead ends: 53914 [2024-10-10 23:26:54,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:26:54,435 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 1158 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:54,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1439 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:26:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53914 states. [2024-10-10 23:26:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53914 to 53913. [2024-10-10 23:26:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53913 states, 53912 states have (on average 1.1423245288618489) internal successors, (61585), 53912 states have internal predecessors, (61585), 0 states have call successors, (0), 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:26:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53913 states to 53913 states and 61585 transitions. [2024-10-10 23:26:55,258 INFO L78 Accepts]: Start accepts. Automaton has 53913 states and 61585 transitions. Word has length 289 [2024-10-10 23:26:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:26:55,259 INFO L471 AbstractCegarLoop]: Abstraction has 53913 states and 61585 transitions. [2024-10-10 23:26:55,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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:26:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 53913 states and 61585 transitions. [2024-10-10 23:26:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-10 23:26:55,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:26:55,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:26:55,292 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:26:55,468 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,SelfDestructingSolverStorable9 [2024-10-10 23:26:55,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:26:55,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:26:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash -104515210, now seen corresponding path program 1 times [2024-10-10 23:26:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:26:55,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132923292] [2024-10-10 23:26:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:55,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:26:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 68 proven. 50 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-10 23:26:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:26:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132923292] [2024-10-10 23:26:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132923292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:26:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321504410] [2024-10-10 23:26:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:26:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:26:56,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:26:56,478 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:26:56,480 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:26:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:26:56,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:26:56,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:26:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:26:56,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:26:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321504410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:26:56,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:26:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:26:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577081431] [2024-10-10 23:26:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:26:56,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:26:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:26:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:26:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:26:56,706 INFO L87 Difference]: Start difference. First operand 53913 states and 61585 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:26:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:26:59,715 INFO L93 Difference]: Finished difference Result 106242 states and 121492 transitions. [2024-10-10 23:26:59,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:26:59,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 339 [2024-10-10 23:26:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:26:59,776 INFO L225 Difference]: With dead ends: 106242 [2024-10-10 23:26:59,777 INFO L226 Difference]: Without dead ends: 53117 [2024-10-10 23:26:59,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:26:59,916 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 1092 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:26:59,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 820 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:26:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53117 states. [2024-10-10 23:27:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53117 to 53116. [2024-10-10 23:27:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53116 states, 53115 states have (on average 1.1028146474630518) internal successors, (58576), 53115 states have internal predecessors, (58576), 0 states have call successors, (0), 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:27:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53116 states to 53116 states and 58576 transitions. [2024-10-10 23:27:00,465 INFO L78 Accepts]: Start accepts. Automaton has 53116 states and 58576 transitions. Word has length 339 [2024-10-10 23:27:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:00,466 INFO L471 AbstractCegarLoop]: Abstraction has 53116 states and 58576 transitions. [2024-10-10 23:27:00,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:27:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 53116 states and 58576 transitions. [2024-10-10 23:27:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:27:00,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:00,472 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:00,485 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:27:00,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:00,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:00,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1345710828, now seen corresponding path program 1 times [2024-10-10 23:27:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397792472] [2024-10-10 23:27:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-10 23:27:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397792472] [2024-10-10 23:27:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397792472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091964484] [2024-10-10 23:27:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:00,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:00,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:00,942 INFO L87 Difference]: Start difference. First operand 53116 states and 58576 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:27:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:04,269 INFO L93 Difference]: Finished difference Result 125925 states and 138379 transitions. [2024-10-10 23:27:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:04,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 377 [2024-10-10 23:27:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:04,358 INFO L225 Difference]: With dead ends: 125925 [2024-10-10 23:27:04,358 INFO L226 Difference]: Without dead ends: 73597 [2024-10-10 23:27:04,388 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:27:04,389 INFO L432 NwaCegarLoop]: 1265 mSDtfsCounter, 1059 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:04,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1314 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:27:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73597 states. [2024-10-10 23:27:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73597 to 72001. [2024-10-10 23:27:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72001 states, 72000 states have (on average 1.085125) internal successors, (78129), 72000 states have internal predecessors, (78129), 0 states have call successors, (0), 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:27:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72001 states to 72001 states and 78129 transitions. [2024-10-10 23:27:05,510 INFO L78 Accepts]: Start accepts. Automaton has 72001 states and 78129 transitions. Word has length 377 [2024-10-10 23:27:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:05,511 INFO L471 AbstractCegarLoop]: Abstraction has 72001 states and 78129 transitions. [2024-10-10 23:27:05,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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:27:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 72001 states and 78129 transitions. [2024-10-10 23:27:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-10-10 23:27:05,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:05,526 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:27:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:27:05,527 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:05,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:05,527 INFO L85 PathProgramCache]: Analyzing trace with hash 952329451, now seen corresponding path program 1 times [2024-10-10 23:27:05,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:05,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498915606] [2024-10-10 23:27:05,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:05,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:27:06,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498915606] [2024-10-10 23:27:06,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498915606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:06,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:06,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972690930] [2024-10-10 23:27:06,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:06,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:06,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:06,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:06,093 INFO L87 Difference]: Start difference. First operand 72001 states and 78129 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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:27:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:09,520 INFO L93 Difference]: Finished difference Result 160542 states and 175215 transitions. [2024-10-10 23:27:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 479 [2024-10-10 23:27:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:09,781 INFO L225 Difference]: With dead ends: 160542 [2024-10-10 23:27:09,782 INFO L226 Difference]: Without dead ends: 88542 [2024-10-10 23:27:09,817 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:27:09,818 INFO L432 NwaCegarLoop]: 1827 mSDtfsCounter, 728 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:09,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1974 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:27:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88542 states. [2024-10-10 23:27:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88542 to 86953. [2024-10-10 23:27:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86953 states, 86952 states have (on average 1.073385316036434) internal successors, (93333), 86952 states have internal predecessors, (93333), 0 states have call successors, (0), 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:27:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86953 states to 86953 states and 93333 transitions. [2024-10-10 23:27:10,904 INFO L78 Accepts]: Start accepts. Automaton has 86953 states and 93333 transitions. Word has length 479 [2024-10-10 23:27:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:10,904 INFO L471 AbstractCegarLoop]: Abstraction has 86953 states and 93333 transitions. [2024-10-10 23:27:10,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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:27:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 86953 states and 93333 transitions. [2024-10-10 23:27:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-10-10 23:27:10,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:10,922 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:27:10,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:27:10,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:10,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1293333723, now seen corresponding path program 1 times [2024-10-10 23:27:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:10,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427741652] [2024-10-10 23:27:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-10 23:27:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427741652] [2024-10-10 23:27:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427741652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:11,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868222420] [2024-10-10 23:27:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:11,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:11,509 INFO L87 Difference]: Start difference. First operand 86953 states and 93333 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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:27:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:14,868 INFO L93 Difference]: Finished difference Result 191230 states and 206462 transitions. [2024-10-10 23:27:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 488 [2024-10-10 23:27:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:14,997 INFO L225 Difference]: With dead ends: 191230 [2024-10-10 23:27:14,997 INFO L226 Difference]: Without dead ends: 105065 [2024-10-10 23:27:15,041 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:27:15,041 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 917 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 3301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:15,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 742 Invalid, 3301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:27:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105065 states. [2024-10-10 23:27:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105065 to 104264. [2024-10-10 23:27:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104264 states, 104263 states have (on average 1.0756260610187698) internal successors, (112148), 104263 states have internal predecessors, (112148), 0 states have call successors, (0), 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:27:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104264 states to 104264 states and 112148 transitions. [2024-10-10 23:27:16,706 INFO L78 Accepts]: Start accepts. Automaton has 104264 states and 112148 transitions. Word has length 488 [2024-10-10 23:27:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:16,707 INFO L471 AbstractCegarLoop]: Abstraction has 104264 states and 112148 transitions. [2024-10-10 23:27:16,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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:27:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 104264 states and 112148 transitions. [2024-10-10 23:27:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-10-10 23:27:16,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:16,721 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:16,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:27:16,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1296303141, now seen corresponding path program 1 times [2024-10-10 23:27:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42514356] [2024-10-10 23:27:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:27:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42514356] [2024-10-10 23:27:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42514356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:17,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:17,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947083295] [2024-10-10 23:27:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:17,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:17,033 INFO L87 Difference]: Start difference. First operand 104264 states and 112148 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)