./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e06ef1412a74393ad84e9e1ded9df4a85465ae72dfa72ae2b083f3676b944dcb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:20:29,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:20:29,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:20:29,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:20:29,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:20:30,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:20:30,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:20:30,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:20:30,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:20:30,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:20:30,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:20:30,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:20:30,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:20:30,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:20:30,029 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:20:30,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:20:30,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:20:30,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:20:30,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:20:30,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:20:30,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:20:30,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:20:30,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:20:30,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:20:30,032 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:20:30,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:20:30,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:20:30,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:20:30,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:20:30,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:20:30,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:20:30,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:20:30,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:30,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:20:30,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:20:30,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:20:30,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:20:30,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:20:30,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:20:30,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:20:30,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:20:30,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:20:30,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e06ef1412a74393ad84e9e1ded9df4a85465ae72dfa72ae2b083f3676b944dcb [2024-11-09 19:20:30,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:20:30,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:20:30,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:20:30,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:20:30,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:20:30,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label50.c [2024-11-09 19:20:31,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:20:32,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:20:32,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label50.c [2024-11-09 19:20:32,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/747f130ae/52cb3545f1164156aeacbdee863b6080/FLAG7dd372d7f [2024-11-09 19:20:32,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/747f130ae/52cb3545f1164156aeacbdee863b6080 [2024-11-09 19:20:32,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:20:32,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:20:32,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:32,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:20:32,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:20:32,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26dcd662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32, skipping insertion in model container [2024-11-09 19:20:32,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:20:32,356 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label50.c[1307,1320] [2024-11-09 19:20:32,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:32,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:20:32,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label50.c[1307,1320] [2024-11-09 19:20:32,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:32,685 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:20:32,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32 WrapperNode [2024-11-09 19:20:32,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:32,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:32,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:20:32,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:20:32,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,769 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-09 19:20:32,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:32,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:20:32,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:20:32,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:20:32,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,850 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:20:32,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:20:32,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:20:32,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:20:32,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:20:32,932 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (1/1) ... [2024-11-09 19:20:32,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:32,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:32,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:20:32,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:20:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:20:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:20:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:20:33,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:20:33,101 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:20:33,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:20:34,366 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-09 19:20:34,366 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:20:34,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:20:34,389 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:20:34,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:34 BoogieIcfgContainer [2024-11-09 19:20:34,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:20:34,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:20:34,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:20:34,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:20:34,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:20:32" (1/3) ... [2024-11-09 19:20:34,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669c518a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:34, skipping insertion in model container [2024-11-09 19:20:34,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:32" (2/3) ... [2024-11-09 19:20:34,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669c518a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:34, skipping insertion in model container [2024-11-09 19:20:34,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:34" (3/3) ... [2024-11-09 19:20:34,400 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2024-11-09 19:20:34,416 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:20:34,417 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:20:34,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:20:34,502 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;@21b4bb9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:20:34,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:20:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 19:20:34,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:34,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:34,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:34,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1683241625, now seen corresponding path program 1 times [2024-11-09 19:20:34,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:34,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540836192] [2024-11-09 19:20:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:34,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540836192] [2024-11-09 19:20:34,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540836192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:34,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:34,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282321374] [2024-11-09 19:20:34,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:34,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:34,789 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 2.033816425120773) internal successors, (421), 208 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:35,826 INFO L93 Difference]: Finished difference Result 573 states and 1209 transitions. [2024-11-09 19:20:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:35,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 19:20:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:35,840 INFO L225 Difference]: With dead ends: 573 [2024-11-09 19:20:35,840 INFO L226 Difference]: Without dead ends: 285 [2024-11-09 19:20:35,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:35,847 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 243 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:35,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 70 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:20:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-09 19:20:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-09 19:20:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.982394366197183) internal successors, (563), 284 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 563 transitions. [2024-11-09 19:20:35,913 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 563 transitions. Word has length 11 [2024-11-09 19:20:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:35,914 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 563 transitions. [2024-11-09 19:20:35,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 563 transitions. [2024-11-09 19:20:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 19:20:35,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:35,920 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:20:35,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:20:35,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:35,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1472295272, now seen corresponding path program 1 times [2024-11-09 19:20:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:35,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304179134] [2024-11-09 19:20:35,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:35,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:36,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:36,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304179134] [2024-11-09 19:20:36,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304179134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:36,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:36,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389856661] [2024-11-09 19:20:36,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:36,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:36,184 INFO L87 Difference]: Start difference. First operand 285 states and 563 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:36,792 INFO L93 Difference]: Finished difference Result 848 states and 1683 transitions. [2024-11-09 19:20:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:36,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-09 19:20:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:36,797 INFO L225 Difference]: With dead ends: 848 [2024-11-09 19:20:36,797 INFO L226 Difference]: Without dead ends: 565 [2024-11-09 19:20:36,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:36,799 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 149 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:36,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 71 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-09 19:20:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2024-11-09 19:20:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.8280141843971631) internal successors, (1031), 564 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1031 transitions. [2024-11-09 19:20:36,845 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1031 transitions. Word has length 82 [2024-11-09 19:20:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:36,846 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 1031 transitions. [2024-11-09 19:20:36,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1031 transitions. [2024-11-09 19:20:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 19:20:36,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:36,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:36,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:20:36,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:36,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 776748812, now seen corresponding path program 1 times [2024-11-09 19:20:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:36,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688382973] [2024-11-09 19:20:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:37,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688382973] [2024-11-09 19:20:37,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688382973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:37,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:37,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802906191] [2024-11-09 19:20:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:37,006 INFO L87 Difference]: Start difference. First operand 565 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:37,641 INFO L93 Difference]: Finished difference Result 1408 states and 2619 transitions. [2024-11-09 19:20:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-09 19:20:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:37,645 INFO L225 Difference]: With dead ends: 1408 [2024-11-09 19:20:37,646 INFO L226 Difference]: Without dead ends: 845 [2024-11-09 19:20:37,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:37,648 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:37,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 290 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-09 19:20:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-11-09 19:20:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.7938388625592416) internal successors, (1514), 844 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1514 transitions. [2024-11-09 19:20:37,674 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1514 transitions. Word has length 87 [2024-11-09 19:20:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:37,674 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1514 transitions. [2024-11-09 19:20:37,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1514 transitions. [2024-11-09 19:20:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 19:20:37,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:37,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:37,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:20:37,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -793998020, now seen corresponding path program 1 times [2024-11-09 19:20:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429199774] [2024-11-09 19:20:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:37,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429199774] [2024-11-09 19:20:37,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429199774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:37,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:37,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931155332] [2024-11-09 19:20:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:37,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:37,830 INFO L87 Difference]: Start difference. First operand 845 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:38,402 INFO L93 Difference]: Finished difference Result 2248 states and 3977 transitions. [2024-11-09 19:20:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:38,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-09 19:20:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:38,409 INFO L225 Difference]: With dead ends: 2248 [2024-11-09 19:20:38,409 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 19:20:38,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:38,415 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 162 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:38,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 37 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 19:20:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1265. [2024-11-09 19:20:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.701740506329114) internal successors, (2151), 1264 states have internal predecessors, (2151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2151 transitions. [2024-11-09 19:20:38,443 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2151 transitions. Word has length 103 [2024-11-09 19:20:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:38,444 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 2151 transitions. [2024-11-09 19:20:38,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2151 transitions. [2024-11-09 19:20:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 19:20:38,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:38,449 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:20:38,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:38,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash -665310550, now seen corresponding path program 1 times [2024-11-09 19:20:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:38,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142919987] [2024-11-09 19:20:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:38,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:38,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:38,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142919987] [2024-11-09 19:20:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142919987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727645459] [2024-11-09 19:20:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:38,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:38,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:38,703 INFO L87 Difference]: Start difference. First operand 1265 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:39,270 INFO L93 Difference]: Finished difference Result 2668 states and 4524 transitions. [2024-11-09 19:20:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:39,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-09 19:20:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:39,276 INFO L225 Difference]: With dead ends: 2668 [2024-11-09 19:20:39,276 INFO L226 Difference]: Without dead ends: 1405 [2024-11-09 19:20:39,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:39,279 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 123 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:39,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 86 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-09 19:20:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-09 19:20:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.688034188034188) internal successors, (2370), 1404 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2370 transitions. [2024-11-09 19:20:39,313 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2370 transitions. Word has length 104 [2024-11-09 19:20:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:39,314 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2370 transitions. [2024-11-09 19:20:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2370 transitions. [2024-11-09 19:20:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 19:20:39,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:39,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:20:39,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1888560341, now seen corresponding path program 1 times [2024-11-09 19:20:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010969089] [2024-11-09 19:20:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 19:20:39,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010969089] [2024-11-09 19:20:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010969089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:20:39,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576389808] [2024-11-09 19:20:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:39,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:20:39,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:39,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:20:39,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:20:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:39,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:20:39,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:20:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 19:20:40,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:20:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576389808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:20:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:20:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153997479] [2024-11-09 19:20:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:40,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:40,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:40,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:20:40,044 INFO L87 Difference]: Start difference. First operand 1405 states and 2370 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:40,657 INFO L93 Difference]: Finished difference Result 1968 states and 3344 transitions. [2024-11-09 19:20:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:40,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 171 [2024-11-09 19:20:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:40,666 INFO L225 Difference]: With dead ends: 1968 [2024-11-09 19:20:40,666 INFO L226 Difference]: Without dead ends: 1965 [2024-11-09 19:20:40,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:20:40,668 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 159 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:40,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 20 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-09 19:20:40,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1545. [2024-11-09 19:20:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.705958549222798) internal successors, (2634), 1544 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2634 transitions. [2024-11-09 19:20:40,700 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2634 transitions. Word has length 171 [2024-11-09 19:20:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:40,700 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2634 transitions. [2024-11-09 19:20:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2634 transitions. [2024-11-09 19:20:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 19:20:40,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:40,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:40,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:20:40,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:20:40,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:40,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:40,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1788485915, now seen corresponding path program 1 times [2024-11-09 19:20:40,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:40,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698145603] [2024-11-09 19:20:40,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:41,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698145603] [2024-11-09 19:20:41,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698145603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:41,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:41,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999480282] [2024-11-09 19:20:41,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:41,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:41,083 INFO L87 Difference]: Start difference. First operand 1545 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) 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-11-09 19:20:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:41,728 INFO L93 Difference]: Finished difference Result 3368 states and 5830 transitions. [2024-11-09 19:20:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) 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-11-09 19:20:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:41,736 INFO L225 Difference]: With dead ends: 3368 [2024-11-09 19:20:41,736 INFO L226 Difference]: Without dead ends: 1965 [2024-11-09 19:20:41,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:41,739 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 126 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:41,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 292 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-09 19:20:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1825. [2024-11-09 19:20:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1824 states have (on average 1.6902412280701755) internal successors, (3083), 1824 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 3083 transitions. [2024-11-09 19:20:41,774 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 3083 transitions. Word has length 173 [2024-11-09 19:20:41,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:41,775 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 3083 transitions. [2024-11-09 19:20:41,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) 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-11-09 19:20:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 3083 transitions. [2024-11-09 19:20:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-09 19:20:41,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:41,779 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:41,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:20:41,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 72483179, now seen corresponding path program 1 times [2024-11-09 19:20:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252272618] [2024-11-09 19:20:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:42,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:42,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252272618] [2024-11-09 19:20:42,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252272618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:42,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:42,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:20:42,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648566014] [2024-11-09 19:20:42,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:42,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:20:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:42,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:20:42,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:42,276 INFO L87 Difference]: Start difference. First operand 1825 states and 3083 transitions. Second operand has 7 states, 7 states have (on average 32.142857142857146) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:43,000 INFO L93 Difference]: Finished difference Result 3564 states and 6001 transitions. [2024-11-09 19:20:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:20:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.142857142857146) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-11-09 19:20:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:43,007 INFO L225 Difference]: With dead ends: 3564 [2024-11-09 19:20:43,007 INFO L226 Difference]: Without dead ends: 1825 [2024-11-09 19:20:43,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:20:43,010 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 217 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:43,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 41 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:20:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-09 19:20:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1825. [2024-11-09 19:20:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1824 states have (on average 1.6864035087719298) internal successors, (3076), 1824 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 3076 transitions. [2024-11-09 19:20:43,043 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 3076 transitions. Word has length 225 [2024-11-09 19:20:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:43,044 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 3076 transitions. [2024-11-09 19:20:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.142857142857146) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 3076 transitions. [2024-11-09 19:20:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 19:20:43,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:43,048 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:43,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:20:43,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:43,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash 69667415, now seen corresponding path program 1 times [2024-11-09 19:20:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:43,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722973659] [2024-11-09 19:20:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 19:20:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722973659] [2024-11-09 19:20:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722973659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577710565] [2024-11-09 19:20:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:43,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:43,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:43,375 INFO L87 Difference]: Start difference. First operand 1825 states and 3076 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:43,954 INFO L93 Difference]: Finished difference Result 3928 states and 6712 transitions. [2024-11-09 19:20:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 261 [2024-11-09 19:20:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:43,962 INFO L225 Difference]: With dead ends: 3928 [2024-11-09 19:20:43,963 INFO L226 Difference]: Without dead ends: 2245 [2024-11-09 19:20:43,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:43,965 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:43,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 299 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-11-09 19:20:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2105. [2024-11-09 19:20:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 1.6772813688212929) internal successors, (3529), 2104 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3529 transitions. [2024-11-09 19:20:44,008 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3529 transitions. Word has length 261 [2024-11-09 19:20:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:44,008 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 3529 transitions. [2024-11-09 19:20:44,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3529 transitions. [2024-11-09 19:20:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-09 19:20:44,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:44,012 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:20:44,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:20:44,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash 80283716, now seen corresponding path program 1 times [2024-11-09 19:20:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254100926] [2024-11-09 19:20:44,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:20:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254100926] [2024-11-09 19:20:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254100926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:20:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074012351] [2024-11-09 19:20:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:20:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:20:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:20:44,410 INFO L87 Difference]: Start difference. First operand 2105 states and 3529 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 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-11-09 19:20:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:45,224 INFO L93 Difference]: Finished difference Result 4348 states and 7316 transitions. [2024-11-09 19:20:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:20:45,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 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-11-09 19:20:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:45,234 INFO L225 Difference]: With dead ends: 4348 [2024-11-09 19:20:45,234 INFO L226 Difference]: Without dead ends: 2385 [2024-11-09 19:20:45,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:20:45,238 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 456 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:45,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 278 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:20:45,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-11-09 19:20:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2024-11-09 19:20:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2384 states have (on average 1.6661073825503356) internal successors, (3972), 2384 states have internal predecessors, (3972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3972 transitions. [2024-11-09 19:20:45,281 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3972 transitions. Word has length 262 [2024-11-09 19:20:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:45,281 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3972 transitions. [2024-11-09 19:20:45,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 4 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-11-09 19:20:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3972 transitions. [2024-11-09 19:20:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-09 19:20:45,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:45,286 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-09 19:20:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:20:45,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1621698046, now seen corresponding path program 1 times [2024-11-09 19:20:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316521854] [2024-11-09 19:20:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 19:20:45,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316521854] [2024-11-09 19:20:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316521854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63591511] [2024-11-09 19:20:45,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:45,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:45,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:45,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:45,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:45,546 INFO L87 Difference]: Start difference. First operand 2385 states and 3972 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:46,158 INFO L93 Difference]: Finished difference Result 5328 states and 8854 transitions. [2024-11-09 19:20:46,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 275 [2024-11-09 19:20:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:46,170 INFO L225 Difference]: With dead ends: 5328 [2024-11-09 19:20:46,170 INFO L226 Difference]: Without dead ends: 3085 [2024-11-09 19:20:46,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:46,173 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 209 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:46,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 55 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2024-11-09 19:20:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2105. [2024-11-09 19:20:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 1.651615969581749) internal successors, (3475), 2104 states have internal predecessors, (3475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3475 transitions. [2024-11-09 19:20:46,213 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3475 transitions. Word has length 275 [2024-11-09 19:20:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:46,214 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 3475 transitions. [2024-11-09 19:20:46,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3475 transitions. [2024-11-09 19:20:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-09 19:20:46,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:46,218 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-09 19:20:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:20:46,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:46,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash -823849252, now seen corresponding path program 1 times [2024-11-09 19:20:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541123826] [2024-11-09 19:20:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-09 19:20:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541123826] [2024-11-09 19:20:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541123826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:46,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715546652] [2024-11-09 19:20:46,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:46,461 INFO L87 Difference]: Start difference. First operand 2105 states and 3475 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:47,072 INFO L93 Difference]: Finished difference Result 5048 states and 8322 transitions. [2024-11-09 19:20:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 311 [2024-11-09 19:20:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:47,079 INFO L225 Difference]: With dead ends: 5048 [2024-11-09 19:20:47,080 INFO L226 Difference]: Without dead ends: 2105 [2024-11-09 19:20:47,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:47,084 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 207 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:47,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 304 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:20:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2024-11-09 19:20:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2105. [2024-11-09 19:20:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 1.6454372623574145) internal successors, (3462), 2104 states have internal predecessors, (3462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3462 transitions. [2024-11-09 19:20:47,118 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3462 transitions. Word has length 311 [2024-11-09 19:20:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:47,119 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 3462 transitions. [2024-11-09 19:20:47,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3462 transitions. [2024-11-09 19:20:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-09 19:20:47,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:47,126 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:20:47,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:20:47,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:47,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1968031584, now seen corresponding path program 1 times [2024-11-09 19:20:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741942300] [2024-11-09 19:20:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 19:20:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741942300] [2024-11-09 19:20:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741942300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:47,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:20:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464576909] [2024-11-09 19:20:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:47,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:47,470 INFO L87 Difference]: Start difference. First operand 2105 states and 3462 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:48,042 INFO L93 Difference]: Finished difference Result 4068 states and 6704 transitions. [2024-11-09 19:20:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2024-11-09 19:20:48,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:48,050 INFO L225 Difference]: With dead ends: 4068 [2024-11-09 19:20:48,051 INFO L226 Difference]: Without dead ends: 2105 [2024-11-09 19:20:48,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:48,054 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:48,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 289 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:20:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2024-11-09 19:20:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2105. [2024-11-09 19:20:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 1.6183460076045628) internal successors, (3405), 2104 states have internal predecessors, (3405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3405 transitions. [2024-11-09 19:20:48,086 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3405 transitions. Word has length 355 [2024-11-09 19:20:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 3405 transitions. [2024-11-09 19:20:48,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:20:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3405 transitions. [2024-11-09 19:20:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-09 19:20:48,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:48,094 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:20:48,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:20:48,095 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 958056962, now seen corresponding path program 1 times [2024-11-09 19:20:48,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919813139] [2024-11-09 19:20:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 222 proven. 15 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:20:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919813139] [2024-11-09 19:20:49,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919813139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:20:49,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672947020] [2024-11-09 19:20:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:49,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:20:49,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:49,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:20:49,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:20:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:49,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 19:20:49,162 INFO L278 TraceCheckSpWp]: Computing forward predicates...