./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-multidimensional/min-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/min-3-n-u.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9bd7b1a8bed68c803bda82a4dd989302b30da7d6d96131ca67565e0ea166dbcb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:11:48,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:11:48,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:11:48,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:11:48,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:11:48,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:11:48,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:11:48,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:11:48,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:11:48,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:11:48,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:11:48,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:11:48,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:11:48,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:11:48,317 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:11:48,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:11:48,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:11:48,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:11:48,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:11:48,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:11:48,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:11:48,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:11:48,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:11:48,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:11:48,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:11:48,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:11:48,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:11:48,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:11:48,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:11:48,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:11:48,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:11:48,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:11:48,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:11:48,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:11:48,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:11:48,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:11:48,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:11:48,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:11:48,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:11:48,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:11:48,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:11:48,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:11:48,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9bd7b1a8bed68c803bda82a4dd989302b30da7d6d96131ca67565e0ea166dbcb [2024-10-10 22:11:48,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:11:48,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:11:48,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:11:48,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:11:48,536 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:11:48,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/min-3-n-u.c [2024-10-10 22:11:49,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:11:49,936 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:11:49,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/min-3-n-u.c [2024-10-10 22:11:49,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4a2087c9/dee4243d131b4d8b86f4627828e1c8e8/FLAG64fcb87e1 [2024-10-10 22:11:50,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4a2087c9/dee4243d131b4d8b86f4627828e1c8e8 [2024-10-10 22:11:50,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:11:50,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:11:50,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:11:50,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:11:50,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:11:50,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4c5ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50, skipping insertion in model container [2024-10-10 22:11:50,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:11:50,514 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-multidimensional/min-3-n-u.c[321,334] [2024-10-10 22:11:50,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:11:50,537 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:11:50,547 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-multidimensional/min-3-n-u.c[321,334] [2024-10-10 22:11:50,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:11:50,566 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:11:50,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50 WrapperNode [2024-10-10 22:11:50,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:11:50,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:11:50,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:11:50,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:11:50,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,596 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 109 [2024-10-10 22:11:50,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:11:50,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:11:50,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:11:50,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:11:50,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,617 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 1 writes are split as follows [0, 1]. [2024-10-10 22:11:50,617 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,617 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,621 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:11:50,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:11:50,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:11:50,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:11:50,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (1/1) ... [2024-10-10 22:11:50,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:11:50,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:50,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:11:50,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:11:50,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:11:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:11:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:11:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:11:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:11:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:11:50,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:11:50,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:11:50,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:11:50,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:11:50,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:11:50,758 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:11:50,760 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:11:50,919 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-10 22:11:50,920 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:11:50,984 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:11:50,985 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-10 22:11:50,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:11:50 BoogieIcfgContainer [2024-10-10 22:11:50,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:11:50,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:11:50,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:11:50,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:11:50,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:11:50" (1/3) ... [2024-10-10 22:11:50,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256c6bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:11:50, skipping insertion in model container [2024-10-10 22:11:50,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:11:50" (2/3) ... [2024-10-10 22:11:50,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256c6bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:11:50, skipping insertion in model container [2024-10-10 22:11:50,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:11:50" (3/3) ... [2024-10-10 22:11:50,994 INFO L112 eAbstractionObserver]: Analyzing ICFG min-3-n-u.c [2024-10-10 22:11:51,029 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:11:51,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:11:51,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:11:51,082 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;@41ed9783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:11:51,082 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:11:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:11:51,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:51,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:51,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:51,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash -930939884, now seen corresponding path program 1 times [2024-10-10 22:11:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420147352] [2024-10-10 22:11:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:11:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:51,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420147352] [2024-10-10 22:11:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420147352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:11:51,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:11:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:11:51,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686618739] [2024-10-10 22:11:51,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:11:51,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:11:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:11:51,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:11:51,246 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:51,267 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2024-10-10 22:11:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:11:51,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-10 22:11:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:51,275 INFO L225 Difference]: With dead ends: 51 [2024-10-10 22:11:51,275 INFO L226 Difference]: Without dead ends: 24 [2024-10-10 22:11:51,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:11:51,279 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:51,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:11:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-10 22:11:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-10 22:11:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-10-10 22:11:51,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 10 [2024-10-10 22:11:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:51,302 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-10-10 22:11:51,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2024-10-10 22:11:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:11:51,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:51,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:51,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:11:51,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:51,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1753086454, now seen corresponding path program 1 times [2024-10-10 22:11:51,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:51,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91946710] [2024-10-10 22:11:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:11:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:51,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91946710] [2024-10-10 22:11:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91946710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:11:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:11:51,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:11:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447680060] [2024-10-10 22:11:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:11:51,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:11:51,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:11:51,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:11:51,397 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:51,431 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2024-10-10 22:11:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:11:51,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-10 22:11:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:51,432 INFO L225 Difference]: With dead ends: 47 [2024-10-10 22:11:51,432 INFO L226 Difference]: Without dead ends: 29 [2024-10-10 22:11:51,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:11:51,434 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:51,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:11:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-10 22:11:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-10-10 22:11:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-10 22:11:51,439 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 10 [2024-10-10 22:11:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:51,440 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-10 22:11:51,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-10 22:11:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:11:51,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:51,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:51,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:11:51,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1762293580, now seen corresponding path program 1 times [2024-10-10 22:11:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:51,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920461433] [2024-10-10 22:11:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:11:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920461433] [2024-10-10 22:11:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920461433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:11:51,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:11:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:11:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43474118] [2024-10-10 22:11:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:11:51,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:11:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:51,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:11:51,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:11:51,535 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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-10 22:11:51,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:51,587 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2024-10-10 22:11:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:11:51,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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-10 22:11:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:51,588 INFO L225 Difference]: With dead ends: 63 [2024-10-10 22:11:51,588 INFO L226 Difference]: Without dead ends: 40 [2024-10-10 22:11:51,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:11:51,589 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:51,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 35 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:11:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-10 22:11:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2024-10-10 22:11:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 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-10 22:11:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-10-10 22:11:51,594 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 13 [2024-10-10 22:11:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-10-10 22:11:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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-10 22:11:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-10-10 22:11:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:11:51,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:51,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:11:51,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 501424532, now seen corresponding path program 1 times [2024-10-10 22:11:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359811963] [2024-10-10 22:11:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:11:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359811963] [2024-10-10 22:11:51,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359811963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:11:51,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:11:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:11:51,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304766885] [2024-10-10 22:11:51,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:11:51,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:11:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:51,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:11:51,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:11:51,666 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:51,704 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2024-10-10 22:11:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:11:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:11:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:51,705 INFO L225 Difference]: With dead ends: 63 [2024-10-10 22:11:51,705 INFO L226 Difference]: Without dead ends: 37 [2024-10-10 22:11:51,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:11:51,706 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:51,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 43 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:11:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-10 22:11:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2024-10-10 22:11:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-10-10 22:11:51,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 16 [2024-10-10 22:11:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:51,712 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-10-10 22:11:51,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-10-10 22:11:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:11:51,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:51,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:51,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:11:51,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:51,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1794806821, now seen corresponding path program 1 times [2024-10-10 22:11:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702091413] [2024-10-10 22:11:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:11:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702091413] [2024-10-10 22:11:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702091413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:11:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:11:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:11:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615109641] [2024-10-10 22:11:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:11:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:11:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:11:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:11:51,817 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:51,872 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-10-10 22:11:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:11:51,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:11:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:51,874 INFO L225 Difference]: With dead ends: 69 [2024-10-10 22:11:51,874 INFO L226 Difference]: Without dead ends: 57 [2024-10-10 22:11:51,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:11:51,875 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:51,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:11:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-10 22:11:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2024-10-10 22:11:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-10 22:11:51,887 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 17 [2024-10-10 22:11:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:51,888 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-10 22:11:51,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-10-10 22:11:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:11:51,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:51,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:51,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:11:51,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:51,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash -721141635, now seen corresponding path program 1 times [2024-10-10 22:11:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044936931] [2024-10-10 22:11:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:11:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044936931] [2024-10-10 22:11:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044936931] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:51,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545082292] [2024-10-10 22:11:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:51,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:51,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:51,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:52,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:11:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:52,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:11:52,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:11:52,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:11:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545082292] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:52,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-10 22:11:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556234786] [2024-10-10 22:11:52,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:52,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:11:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:11:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:11:52,173 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:52,267 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2024-10-10 22:11:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:11:52,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-10 22:11:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:52,269 INFO L225 Difference]: With dead ends: 89 [2024-10-10 22:11:52,269 INFO L226 Difference]: Without dead ends: 59 [2024-10-10 22:11:52,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:11:52,270 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 148 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:52,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 87 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:11:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-10 22:11:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2024-10-10 22:11:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-10-10 22:11:52,281 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 26 [2024-10-10 22:11:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:52,282 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-10-10 22:11:52,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-10-10 22:11:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:11:52,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:52,283 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:52,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:11:52,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:52,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:52,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash 446762308, now seen corresponding path program 2 times [2024-10-10 22:11:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112091891] [2024-10-10 22:11:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 22:11:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112091891] [2024-10-10 22:11:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112091891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:52,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997862266] [2024-10-10 22:11:52,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:11:52,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:52,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:52,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:52,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:11:52,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:11:52,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:11:52,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:11:52,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 22:11:52,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 22:11:52,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997862266] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:52,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:52,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-10 22:11:52,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746750833] [2024-10-10 22:11:52,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:52,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-10 22:11:52,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:52,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-10 22:11:52,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:11:52,871 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 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-10 22:11:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:53,080 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2024-10-10 22:11:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:11:53,080 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 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) Word has length 38 [2024-10-10 22:11:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:53,083 INFO L225 Difference]: With dead ends: 164 [2024-10-10 22:11:53,083 INFO L226 Difference]: Without dead ends: 113 [2024-10-10 22:11:53,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:11:53,085 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 347 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:53,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 175 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:11:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-10 22:11:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2024-10-10 22:11:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2024-10-10 22:11:53,121 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 38 [2024-10-10 22:11:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:53,121 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2024-10-10 22:11:53,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 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-10 22:11:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2024-10-10 22:11:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-10 22:11:53,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:53,123 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:53,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:11:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:53,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 528775908, now seen corresponding path program 3 times [2024-10-10 22:11:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043036241] [2024-10-10 22:11:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-10 22:11:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043036241] [2024-10-10 22:11:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043036241] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315302066] [2024-10-10 22:11:53,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:11:53,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:53,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:53,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:53,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:11:53,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:11:53,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:11:53,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:11:53,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-10 22:11:53,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-10 22:11:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315302066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:53,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:53,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 17 [2024-10-10 22:11:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791843040] [2024-10-10 22:11:53,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:53,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-10 22:11:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-10 22:11:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:11:53,816 INFO L87 Difference]: Start difference. First operand 95 states and 122 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:54,726 INFO L93 Difference]: Finished difference Result 272 states and 334 transitions. [2024-10-10 22:11:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-10 22:11:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 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-10 22:11:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:54,728 INFO L225 Difference]: With dead ends: 272 [2024-10-10 22:11:54,728 INFO L226 Difference]: Without dead ends: 179 [2024-10-10 22:11:54,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1355, Invalid=2935, Unknown=0, NotChecked=0, Total=4290 [2024-10-10 22:11:54,730 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 490 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:54,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 116 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:11:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-10 22:11:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2024-10-10 22:11:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.236842105263158) internal successors, (188), 152 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2024-10-10 22:11:54,747 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 62 [2024-10-10 22:11:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:54,747 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2024-10-10 22:11:54,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2024-10-10 22:11:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-10 22:11:54,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:54,748 INFO L215 NwaCegarLoop]: trace histogram [44, 11, 11, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:54,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:11:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:54,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -902850868, now seen corresponding path program 4 times [2024-10-10 22:11:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268651858] [2024-10-10 22:11:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1356 backedges. 443 proven. 66 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2024-10-10 22:11:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268651858] [2024-10-10 22:11:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268651858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202499016] [2024-10-10 22:11:55,408 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:11:55,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:55,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:55,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:55,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:11:55,513 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:11:55,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:11:55,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-10 22:11:55,527 INFO L278 TraceCheckSpWp]: Computing forward predicates...