./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.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 2638891780f697dd700286595ba75a607e61cda7473ecc330660e8dbb3e9ba64 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 14:26:15,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 14:26:15,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 14:26:15,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 14:26:15,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 14:26:15,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 14:26:15,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 14:26:15,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 14:26:15,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 14:26:15,404 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 14:26:15,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 14:26:15,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 14:26:15,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 14:26:15,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 14:26:15,406 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 14:26:15,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 14:26:15,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 14:26:15,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 14:26:15,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 14:26:15,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 14:26:15,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 14:26:15,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 14:26:15,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 14:26:15,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 14:26:15,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 14:26:15,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 14:26:15,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 14:26:15,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 14:26:15,409 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 14:26:15,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 14:26:15,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 14:26:15,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 14:26:15,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 14:26:15,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 14:26:15,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 14:26:15,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 14:26:15,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 14:26:15,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 14:26:15,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 14:26:15,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 14:26:15,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 14:26:15,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 14:26:15,416 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 -> 2638891780f697dd700286595ba75a607e61cda7473ecc330660e8dbb3e9ba64 [2024-10-12 14:26:15,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 14:26:15,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 14:26:15,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 14:26:15,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 14:26:15,661 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 14:26:15,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.c [2024-10-12 14:26:16,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 14:26:17,061 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 14:26:17,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.c [2024-10-12 14:26:17,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6aed599/c081dfcf37614ef3809e7aff392622b1/FLAGa80a71068 [2024-10-12 14:26:17,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6aed599/c081dfcf37614ef3809e7aff392622b1 [2024-10-12 14:26:17,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 14:26:17,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 14:26:17,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 14:26:17,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 14:26:17,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 14:26:17,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ba336c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17, skipping insertion in model container [2024-10-12 14:26:17,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 14:26:17,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.c[324,337] [2024-10-12 14:26:17,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 14:26:17,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 14:26:17,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_10_ground.c[324,337] [2024-10-12 14:26:17,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 14:26:17,672 INFO L204 MainTranslator]: Completed translation [2024-10-12 14:26:17,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17 WrapperNode [2024-10-12 14:26:17,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 14:26:17,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 14:26:17,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 14:26:17,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 14:26:17,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,704 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-12 14:26:17,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 14:26:17,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 14:26:17,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 14:26:17,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 14:26:17,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,732 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-12 14:26:17,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 14:26:17,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 14:26:17,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 14:26:17,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 14:26:17,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (1/1) ... [2024-10-12 14:26:17,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 14:26:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:17,771 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-10-12 14:26:17,773 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-10-12 14:26:17,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 14:26:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 14:26:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 14:26:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 14:26:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 14:26:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 14:26:17,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 14:26:17,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 14:26:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 14:26:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 14:26:17,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 14:26:17,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 14:26:17,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 14:26:18,006 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 14:26:18,006 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 14:26:18,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 14:26:18,033 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 14:26:18,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 02:26:18 BoogieIcfgContainer [2024-10-12 14:26:18,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 14:26:18,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 14:26:18,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 14:26:18,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 14:26:18,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 02:26:17" (1/3) ... [2024-10-12 14:26:18,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41189bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 02:26:18, skipping insertion in model container [2024-10-12 14:26:18,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:26:17" (2/3) ... [2024-10-12 14:26:18,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41189bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 02:26:18, skipping insertion in model container [2024-10-12 14:26:18,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 02:26:18" (3/3) ... [2024-10-12 14:26:18,043 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_10_ground.c [2024-10-12 14:26:18,057 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 14:26:18,058 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 14:26:18,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 14:26:18,110 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;@6bf51a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 14:26:18,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 14:26:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 14:26:18,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:18,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:18,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1901142431, now seen corresponding path program 1 times [2024-10-12 14:26:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426187257] [2024-10-12 14:26:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:18,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 14:26:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426187257] [2024-10-12 14:26:18,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426187257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:26:18,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:26:18,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 14:26:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791889934] [2024-10-12 14:26:18,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:26:18,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 14:26:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:18,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 14:26:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 14:26:18,381 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 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.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:18,419 INFO L93 Difference]: Finished difference Result 33 states and 55 transitions. [2024-10-12 14:26:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 14:26:18,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-12 14:26:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:18,428 INFO L225 Difference]: With dead ends: 33 [2024-10-12 14:26:18,429 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 14:26:18,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 14:26:18,433 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:18,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 14:26:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 14:26:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-12 14:26:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2024-10-12 14:26:18,459 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 9 [2024-10-12 14:26:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:18,459 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2024-10-12 14:26:18,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2024-10-12 14:26:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 14:26:18,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:18,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:18,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 14:26:18,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -37017485, now seen corresponding path program 1 times [2024-10-12 14:26:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420361366] [2024-10-12 14:26:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 14:26:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:18,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420361366] [2024-10-12 14:26:18,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420361366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:26:18,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:26:18,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 14:26:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166499865] [2024-10-12 14:26:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:26:18,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 14:26:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:18,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 14:26:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 14:26:18,578 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:18,626 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2024-10-12 14:26:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 14:26:18,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-12 14:26:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:18,627 INFO L225 Difference]: With dead ends: 31 [2024-10-12 14:26:18,628 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 14:26:18,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 14:26:18,629 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:18,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 14:26:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 14:26:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-12 14:26:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-12 14:26:18,638 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2024-10-12 14:26:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:18,638 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-12 14:26:18,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-10-12 14:26:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 14:26:18,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:18,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:18,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 14:26:18,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -851183943, now seen corresponding path program 1 times [2024-10-12 14:26:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895913160] [2024-10-12 14:26:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 14:26:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895913160] [2024-10-12 14:26:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895913160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:26:18,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:26:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 14:26:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883267055] [2024-10-12 14:26:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:26:18,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 14:26:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 14:26:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 14:26:18,699 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:18,714 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2024-10-12 14:26:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 14:26:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-12 14:26:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:18,715 INFO L225 Difference]: With dead ends: 28 [2024-10-12 14:26:18,715 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 14:26:18,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 14:26:18,716 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:18,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 14:26:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 14:26:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 14:26:18,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-12 14:26:18,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 13 [2024-10-12 14:26:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:18,719 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-12 14:26:18,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-12 14:26:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 14:26:18,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:18,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:18,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 14:26:18,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:18,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1058582699, now seen corresponding path program 1 times [2024-10-12 14:26:18,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395474078] [2024-10-12 14:26:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 14:26:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:18,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395474078] [2024-10-12 14:26:18,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395474078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:18,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970456683] [2024-10-12 14:26:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:18,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:18,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:18,863 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-10-12 14:26:18,864 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-10-12 14:26:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:18,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 14:26:18,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 14:26:18,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 14:26:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970456683] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:19,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2024-10-12 14:26:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512759848] [2024-10-12 14:26:19,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:19,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 14:26:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 14:26:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-12 14:26:19,013 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:19,165 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-10-12 14:26:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 14:26:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 14 [2024-10-12 14:26:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:19,166 INFO L225 Difference]: With dead ends: 56 [2024-10-12 14:26:19,167 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 14:26:19,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2024-10-12 14:26:19,168 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:19,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 14:26:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 14:26:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2024-10-12 14:26:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-12 14:26:19,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2024-10-12 14:26:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:19,178 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-12 14:26:19,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-12 14:26:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 14:26:19,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:19,187 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:19,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 14:26:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:19,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash 159487876, now seen corresponding path program 1 times [2024-10-12 14:26:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:19,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809940887] [2024-10-12 14:26:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 14:26:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809940887] [2024-10-12 14:26:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809940887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:19,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094906875] [2024-10-12 14:26:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:19,516 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-10-12 14:26:19,517 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-10-12 14:26:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:19,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 14:26:19,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 14:26:19,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 14:26:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094906875] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:19,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-10-12 14:26:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73043133] [2024-10-12 14:26:19,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:19,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 14:26:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:19,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 14:26:19,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-10-12 14:26:19,739 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:19,857 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2024-10-12 14:26:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 14:26:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 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 20 [2024-10-12 14:26:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:19,858 INFO L225 Difference]: With dead ends: 61 [2024-10-12 14:26:19,858 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 14:26:19,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-10-12 14:26:19,859 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:19,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 14:26:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 14:26:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-12 14:26:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-12 14:26:19,868 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2024-10-12 14:26:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:19,868 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-12 14:26:19,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-12 14:26:19,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 14:26:19,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:19,871 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:19,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 14:26:20,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:20,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:20,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2060541314, now seen corresponding path program 1 times [2024-10-12 14:26:20,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515968566] [2024-10-12 14:26:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515968566] [2024-10-12 14:26:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515968566] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136003864] [2024-10-12 14:26:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:20,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:20,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 14:26:20,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 14:26:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:20,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 14:26:20,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:20,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136003864] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:20,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:20,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-10-12 14:26:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308578298] [2024-10-12 14:26:20,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:20,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 14:26:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:20,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 14:26:20,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=640, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 14:26:20,714 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:20,769 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-10-12 14:26:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 14:26:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-12 14:26:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:20,770 INFO L225 Difference]: With dead ends: 57 [2024-10-12 14:26:20,770 INFO L226 Difference]: Without dead ends: 41 [2024-10-12 14:26:20,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=550, Invalid=640, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 14:26:20,771 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:20,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 14:26:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-12 14:26:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-10-12 14:26:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-12 14:26:20,777 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 26 [2024-10-12 14:26:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:20,778 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-12 14:26:20,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-12 14:26:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 14:26:20,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:20,779 INFO L215 NwaCegarLoop]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:20,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 14:26:20,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:20,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:20,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -278712638, now seen corresponding path program 2 times [2024-10-12 14:26:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472630142] [2024-10-12 14:26:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472630142] [2024-10-12 14:26:21,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472630142] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659701683] [2024-10-12 14:26:21,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 14:26:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:21,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 14:26:21,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 14:26:21,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 14:26:21,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 14:26:21,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 14:26:21,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:21,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659701683] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:22,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2024-10-12 14:26:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110549234] [2024-10-12 14:26:22,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:22,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-10-12 14:26:22,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-10-12 14:26:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2254, Invalid=2716, Unknown=0, NotChecked=0, Total=4970 [2024-10-12 14:26:22,687 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:22,785 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2024-10-12 14:26:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-12 14:26:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 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 38 [2024-10-12 14:26:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:22,786 INFO L225 Difference]: With dead ends: 81 [2024-10-12 14:26:22,786 INFO L226 Difference]: Without dead ends: 65 [2024-10-12 14:26:22,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2254, Invalid=2716, Unknown=0, NotChecked=0, Total=4970 [2024-10-12 14:26:22,788 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:22,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 14:26:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-12 14:26:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-10-12 14:26:22,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-12 14:26:22,806 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 38 [2024-10-12 14:26:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:22,806 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-12 14:26:22,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-12 14:26:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 14:26:22,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:22,809 INFO L215 NwaCegarLoop]: trace histogram [46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:22,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 14:26:23,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:23,012 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:23,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash 939995458, now seen corresponding path program 3 times [2024-10-12 14:26:23,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351144729] [2024-10-12 14:26:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 14:26:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:24,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351144729] [2024-10-12 14:26:24,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351144729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:24,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274444178] [2024-10-12 14:26:24,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 14:26:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:24,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 14:26:24,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 14:26:24,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 14:26:24,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 14:26:24,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 14:26:24,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2024-10-12 14:26:24,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2024-10-12 14:26:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274444178] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:24,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 5, 5] total 56 [2024-10-12 14:26:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554572632] [2024-10-12 14:26:24,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-12 14:26:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-12 14:26:24,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1396, Invalid=1796, Unknown=0, NotChecked=0, Total=3192 [2024-10-12 14:26:24,957 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:28,948 INFO L93 Difference]: Finished difference Result 377 states and 484 transitions. [2024-10-12 14:26:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-10-12 14:26:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-12 14:26:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:28,950 INFO L225 Difference]: With dead ends: 377 [2024-10-12 14:26:28,950 INFO L226 Difference]: Without dead ends: 361 [2024-10-12 14:26:28,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10560 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=12550, Invalid=27250, Unknown=0, NotChecked=0, Total=39800 [2024-10-12 14:26:28,957 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 1129 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:28,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 90 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 14:26:28,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-12 14:26:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 265. [2024-10-12 14:26:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.196969696969697) internal successors, (316), 264 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 316 transitions. [2024-10-12 14:26:28,987 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 316 transitions. Word has length 62 [2024-10-12 14:26:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:28,987 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 316 transitions. [2024-10-12 14:26:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 316 transitions. [2024-10-12 14:26:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 14:26:28,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:28,989 INFO L215 NwaCegarLoop]: trace histogram [49, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:29,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 14:26:29,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:29,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2082833861, now seen corresponding path program 1 times [2024-10-12 14:26:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152766859] [2024-10-12 14:26:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:26:30,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:30,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152766859] [2024-10-12 14:26:30,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152766859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:30,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104369922] [2024-10-12 14:26:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:30,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:30,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:30,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 14:26:30,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 14:26:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:30,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-12 14:26:30,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:26:31,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:34,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:26:34,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104369922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:34,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2024-10-12 14:26:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906758825] [2024-10-12 14:26:34,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:34,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2024-10-12 14:26:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:34,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2024-10-12 14:26:34,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10300, Invalid=12652, Unknown=0, NotChecked=0, Total=22952 [2024-10-12 14:26:34,094 INFO L87 Difference]: Start difference. First operand 265 states and 316 transitions. Second operand has 152 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:34,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:34,268 INFO L93 Difference]: Finished difference Result 532 states and 685 transitions. [2024-10-12 14:26:34,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-12 14:26:34,269 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-12 14:26:34,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:34,270 INFO L225 Difference]: With dead ends: 532 [2024-10-12 14:26:34,270 INFO L226 Difference]: Without dead ends: 318 [2024-10-12 14:26:34,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9848 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=10300, Invalid=12652, Unknown=0, NotChecked=0, Total=22952 [2024-10-12 14:26:34,272 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:34,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 14:26:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-12 14:26:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2024-10-12 14:26:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.1650793650793652) internal successors, (367), 315 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 367 transitions. [2024-10-12 14:26:34,297 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 367 transitions. Word has length 69 [2024-10-12 14:26:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:34,297 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 367 transitions. [2024-10-12 14:26:34,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 1.0921052631578947) internal successors, (166), 151 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 367 transitions. [2024-10-12 14:26:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 14:26:34,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:34,298 INFO L215 NwaCegarLoop]: trace histogram [100, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:34,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 14:26:34,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:34,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -314447804, now seen corresponding path program 2 times [2024-10-12 14:26:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:34,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29616212] [2024-10-12 14:26:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:26:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5063 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:26:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:26:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29616212] [2024-10-12 14:26:39,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29616212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:26:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828183096] [2024-10-12 14:26:39,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 14:26:39,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:39,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:26:39,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 14:26:39,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 14:26:39,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 14:26:39,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 14:26:39,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-12 14:26:39,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:26:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5063 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:26:42,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:26:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5063 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:26:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828183096] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:26:51,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:26:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 304 [2024-10-12 14:26:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546135839] [2024-10-12 14:26:51,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:26:51,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 305 states [2024-10-12 14:26:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:26:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 305 interpolants. [2024-10-12 14:26:51,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41410, Invalid=51310, Unknown=0, NotChecked=0, Total=92720 [2024-10-12 14:26:51,940 INFO L87 Difference]: Start difference. First operand 316 states and 367 transitions. Second operand has 305 states, 305 states have (on average 1.0459016393442624) internal successors, (319), 304 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:26:52,447 INFO L93 Difference]: Finished difference Result 634 states and 838 transitions. [2024-10-12 14:26:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2024-10-12 14:26:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 305 states, 305 states have (on average 1.0459016393442624) internal successors, (319), 304 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-10-12 14:26:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:26:52,452 INFO L225 Difference]: With dead ends: 634 [2024-10-12 14:26:52,452 INFO L226 Difference]: Without dead ends: 420 [2024-10-12 14:26:52,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40499 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=41410, Invalid=51310, Unknown=0, NotChecked=0, Total=92720 [2024-10-12 14:26:52,457 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 14:26:52,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 14:26:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-12 14:26:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 418. [2024-10-12 14:26:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.1247002398081534) internal successors, (469), 417 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 469 transitions. [2024-10-12 14:26:52,491 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 469 transitions. Word has length 120 [2024-10-12 14:26:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:26:52,491 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 469 transitions. [2024-10-12 14:26:52,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 305 states, 305 states have (on average 1.0459016393442624) internal successors, (319), 304 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:26:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 469 transitions. [2024-10-12 14:26:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-12 14:26:52,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:26:52,493 INFO L215 NwaCegarLoop]: trace histogram [202, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:26:52,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 14:26:52,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:26:52,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:26:52,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:26:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2113666788, now seen corresponding path program 3 times [2024-10-12 14:26:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:26:52,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286580515] [2024-10-12 14:26:52,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:26:52,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:26:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:27:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20516 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 14:27:10,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:27:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286580515] [2024-10-12 14:27:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286580515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:27:10,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804297872] [2024-10-12 14:27:10,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 14:27:10,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:27:10,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:27:10,541 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 14:27:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 14:27:10,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 14:27:10,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 14:27:10,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 14:27:10,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:27:11,445 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2024-10-12 14:27:11,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-10-12 14:27:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 20516 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20510 trivial. 0 not checked. [2024-10-12 14:27:11,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:27:13,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-12 14:27:13,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 14:27:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2024-10-12 14:27:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20516 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 20510 trivial. 0 not checked. [2024-10-12 14:27:14,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804297872] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:27:14,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:27:14,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [204, 9, 9] total 219 [2024-10-12 14:27:14,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006065497] [2024-10-12 14:27:14,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:27:14,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 220 states [2024-10-12 14:27:14,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:27:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2024-10-12 14:27:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21379, Invalid=26800, Unknown=1, NotChecked=0, Total=48180 [2024-10-12 14:27:14,009 INFO L87 Difference]: Start difference. First operand 418 states and 469 transitions. Second operand has 220 states, 220 states have (on average 1.1363636363636365) internal successors, (250), 219 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)