./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.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 df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:43:04,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:43:05,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 15:43:05,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:43:05,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:43:05,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:43:05,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:43:05,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:43:05,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:43:05,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:43:05,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:43:05,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:43:05,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:43:05,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:43:05,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:43:05,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:43:05,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:43:05,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:43:05,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 15:43:05,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:43:05,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:43:05,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:43:05,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:43:05,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:43:05,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:43:05,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:43:05,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:43:05,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:43:05,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:43:05,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:43:05,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:43:05,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:43:05,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:43:05,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:43:05,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:43:05,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:43:05,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 15:43:05,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 15:43:05,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:43:05,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:43:05,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:43:05,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:43:05,139 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 -> df76811034b688387cfe28dd1eb6de91c21580662ac8ddb8163b41c1d6179172 [2024-11-11 15:43:05,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:43:05,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:43:05,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:43:05,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:43:05,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:43:05,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2024-11-11 15:43:06,867 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:43:07,055 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:43:07,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c [2024-11-11 15:43:07,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab181980/d55a7d25279b493ebc9444c3997e0554/FLAGc5ebf443c [2024-11-11 15:43:07,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab181980/d55a7d25279b493ebc9444c3997e0554 [2024-11-11 15:43:07,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:43:07,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:43:07,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:43:07,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:43:07,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:43:07,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d66c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07, skipping insertion in model container [2024-11-11 15:43:07,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:43:07,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c[333,346] [2024-11-11 15:43:07,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:43:07,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:43:07,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/init-non-constant-3-u.c[333,346] [2024-11-11 15:43:07,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:43:07,709 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:43:07,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07 WrapperNode [2024-11-11 15:43:07,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:43:07,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:43:07,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:43:07,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:43:07,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,741 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-11-11 15:43:07,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:43:07,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:43:07,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:43:07,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:43:07,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,768 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 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-11-11 15:43:07,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:43:07,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:43:07,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:43:07,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:43:07,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (1/1) ... [2024-11-11 15:43:07,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:43:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:07,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 15:43:07,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 15:43:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:43:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 15:43:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 15:43:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 15:43:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 15:43:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 15:43:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:43:07,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:43:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 15:43:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 15:43:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 15:43:07,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:43:07,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:43:08,126 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-11 15:43:08,127 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:43:08,139 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:43:08,139 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-11 15:43:08,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:43:08 BoogieIcfgContainer [2024-11-11 15:43:08,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:43:08,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:43:08,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:43:08,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:43:08,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:43:07" (1/3) ... [2024-11-11 15:43:08,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4da5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:43:08, skipping insertion in model container [2024-11-11 15:43:08,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:43:07" (2/3) ... [2024-11-11 15:43:08,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4da5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:43:08, skipping insertion in model container [2024-11-11 15:43:08,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:43:08" (3/3) ... [2024-11-11 15:43:08,149 INFO L112 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u.c [2024-11-11 15:43:08,166 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:43:08,166 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:43:08,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:43:08,222 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;@5b3c2b39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:43:08,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:43:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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-11-11 15:43:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 15:43:08,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:08,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:08,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:08,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 468841592, now seen corresponding path program 1 times [2024-11-11 15:43:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572439417] [2024-11-11 15:43:08,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:08,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:08,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572439417] [2024-11-11 15:43:08,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572439417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 15:43:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467614777] [2024-11-11 15:43:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:08,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 15:43:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:08,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 15:43:08,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 15:43:08,444 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 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) Second operand has 2 states, 2 states have (on average 4.5) 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-11-11 15:43:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:08,461 INFO L93 Difference]: Finished difference Result 40 states and 64 transitions. [2024-11-11 15:43:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 15:43:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) 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-11-11 15:43:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:08,472 INFO L225 Difference]: With dead ends: 40 [2024-11-11 15:43:08,473 INFO L226 Difference]: Without dead ends: 17 [2024-11-11 15:43:08,476 INFO L434 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-11-11 15:43:08,518 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:08,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:43:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-11 15:43:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-11 15:43:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-11 15:43:08,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2024-11-11 15:43:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:08,582 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-11 15:43:08,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) 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-11-11 15:43:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-11-11 15:43:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 15:43:08,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:08,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:08,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 15:43:08,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:08,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:08,585 INFO L85 PathProgramCache]: Analyzing trace with hash -386465062, now seen corresponding path program 1 times [2024-11-11 15:43:08,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:08,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498811408] [2024-11-11 15:43:08,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498811408] [2024-11-11 15:43:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498811408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:08,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:43:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841353858] [2024-11-11 15:43:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:08,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:43:08,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:43:08,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:43:08,726 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-11 15:43:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:08,790 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-11-11 15:43:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:43:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-11 15:43:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:08,791 INFO L225 Difference]: With dead ends: 32 [2024-11-11 15:43:08,791 INFO L226 Difference]: Without dead ends: 22 [2024-11-11 15:43:08,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:43:08,793 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:08,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:43:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-11 15:43:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-11-11 15:43:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2024-11-11 15:43:08,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2024-11-11 15:43:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:08,798 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2024-11-11 15:43:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-11-11 15:43:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-11-11 15:43:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 15:43:08,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:08,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:08,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 15:43:08,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:08,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 750439074, now seen corresponding path program 1 times [2024-11-11 15:43:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783701203] [2024-11-11 15:43:08,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:08,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:08,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783701203] [2024-11-11 15:43:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783701203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:08,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:08,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:43:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664225570] [2024-11-11 15:43:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:43:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:43:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:08,921 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:08,991 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2024-11-11 15:43:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:43:08,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-11 15:43:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:08,994 INFO L225 Difference]: With dead ends: 43 [2024-11-11 15:43:08,994 INFO L226 Difference]: Without dead ends: 28 [2024-11-11 15:43:08,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:08,997 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:09,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:43:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-11 15:43:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2024-11-11 15:43:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-11 15:43:09,014 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2024-11-11 15:43:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:09,015 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-11 15:43:09,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-11 15:43:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 15:43:09,015 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:09,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 15:43:09,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:09,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1168938424, now seen corresponding path program 1 times [2024-11-11 15:43:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823454306] [2024-11-11 15:43:09,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:09,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:09,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823454306] [2024-11-11 15:43:09,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823454306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:43:09,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:43:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:43:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859227412] [2024-11-11 15:43:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:43:09,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:43:09,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:43:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:09,144 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:09,187 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-11-11 15:43:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:43:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-11 15:43:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:09,188 INFO L225 Difference]: With dead ends: 43 [2024-11-11 15:43:09,188 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 15:43:09,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:43:09,190 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:09,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:43:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 15:43:09,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-11 15:43:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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-11-11 15:43:09,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-11 15:43:09,195 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2024-11-11 15:43:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:09,195 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-11 15:43:09,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-11 15:43:09,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 15:43:09,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:09,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:09,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 15:43:09,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:09,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:09,197 INFO L85 PathProgramCache]: Analyzing trace with hash 18975699, now seen corresponding path program 1 times [2024-11-11 15:43:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:09,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969227844] [2024-11-11 15:43:09,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969227844] [2024-11-11 15:43:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969227844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944260709] [2024-11-11 15:43:09,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:09,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:09,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:09,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:43:09,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 15:43:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:09,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:43:09,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:09,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944260709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:09,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-11 15:43:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760572863] [2024-11-11 15:43:09,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 15:43:09,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 15:43:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-11 15:43:09,532 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-11-11 15:43:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:09,630 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2024-11-11 15:43:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:43:09,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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) Word has length 16 [2024-11-11 15:43:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:09,631 INFO L225 Difference]: With dead ends: 59 [2024-11-11 15:43:09,631 INFO L226 Difference]: Without dead ends: 40 [2024-11-11 15:43:09,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 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-11-11 15:43:09,633 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:09,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 30 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:43:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-11 15:43:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-11-11 15:43:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-11 15:43:09,640 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2024-11-11 15:43:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:09,640 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-11 15:43:09,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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-11-11 15:43:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-11 15:43:09,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 15:43:09,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:09,641 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:09,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 15:43:09,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:09,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:09,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash -163134344, now seen corresponding path program 2 times [2024-11-11 15:43:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:09,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38509588] [2024-11-11 15:43:09,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 15:43:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38509588] [2024-11-11 15:43:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38509588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63186270] [2024-11-11 15:43:09,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:43:09,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:09,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:09,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:43:09,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 15:43:10,026 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 15:43:10,026 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:43:10,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 15:43:10,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:10,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:43:10,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63186270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:10,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2024-11-11 15:43:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922849333] [2024-11-11 15:43:10,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:10,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 15:43:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 15:43:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-11 15:43:10,240 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-11-11 15:43:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:10,894 INFO L93 Difference]: Finished difference Result 237 states and 292 transitions. [2024-11-11 15:43:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 15:43:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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) Word has length 19 [2024-11-11 15:43:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:10,897 INFO L225 Difference]: With dead ends: 237 [2024-11-11 15:43:10,897 INFO L226 Difference]: Without dead ends: 206 [2024-11-11 15:43:10,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 15:43:10,899 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 660 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:10,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 55 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:43:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-11 15:43:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 104. [2024-11-11 15:43:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2621359223300972) internal successors, (130), 103 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2024-11-11 15:43:10,920 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 19 [2024-11-11 15:43:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:10,921 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2024-11-11 15:43:10,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-11-11 15:43:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2024-11-11 15:43:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 15:43:10,922 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:10,922 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:10,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 15:43:11,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 15:43:11,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:11,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1434949022, now seen corresponding path program 3 times [2024-11-11 15:43:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:11,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487173565] [2024-11-11 15:43:11,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-11 15:43:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487173565] [2024-11-11 15:43:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487173565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463546402] [2024-11-11 15:43:11,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 15:43:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:11,332 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-11-11 15:43:11,333 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-11-11 15:43:11,408 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-11 15:43:11,409 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:43:11,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:43:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-11 15:43:11,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-11 15:43:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463546402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:11,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-11 15:43:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467167127] [2024-11-11 15:43:11,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:11,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 15:43:11,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:11,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 15:43:11,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-11 15:43:11,606 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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-11-11 15:43:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:11,684 INFO L93 Difference]: Finished difference Result 263 states and 323 transitions. [2024-11-11 15:43:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:43:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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 38 [2024-11-11 15:43:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:11,689 INFO L225 Difference]: With dead ends: 263 [2024-11-11 15:43:11,689 INFO L226 Difference]: Without dead ends: 191 [2024-11-11 15:43:11,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-11 15:43:11,693 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:11,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:43:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-11 15:43:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-11 15:43:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.1894736842105262) internal successors, (226), 190 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 226 transitions. [2024-11-11 15:43:11,762 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 226 transitions. Word has length 38 [2024-11-11 15:43:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 226 transitions. [2024-11-11 15:43:11,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 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-11-11 15:43:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 226 transitions. [2024-11-11 15:43:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 15:43:11,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:11,767 INFO L218 NwaCegarLoop]: trace histogram [80, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:11,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 15:43:11,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:11,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash 428727514, now seen corresponding path program 4 times [2024-11-11 15:43:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004332161] [2024-11-11 15:43:11,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 862 proven. 55 refuted. 0 times theorem prover too weak. 3021 trivial. 0 not checked. [2024-11-11 15:43:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004332161] [2024-11-11 15:43:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004332161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:12,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918425] [2024-11-11 15:43:12,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 15:43:12,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:12,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:12,731 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-11-11 15:43:12,733 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-11-11 15:43:12,948 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 15:43:12,949 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:43:12,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 15:43:12,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:43:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 1540 proven. 135 refuted. 0 times theorem prover too weak. 2263 trivial. 0 not checked. [2024-11-11 15:43:13,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:43:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3938 backedges. 1540 proven. 135 refuted. 0 times theorem prover too weak. 2263 trivial. 0 not checked. [2024-11-11 15:43:13,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918425] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:43:13,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:43:13,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 42 [2024-11-11 15:43:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758001593] [2024-11-11 15:43:13,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:43:13,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-11 15:43:13,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:43:13,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-11 15:43:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1358, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 15:43:13,595 INFO L87 Difference]: Start difference. First operand 191 states and 226 transitions. Second operand has 42 states, 42 states have (on average 1.619047619047619) internal successors, (68), 42 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-11-11 15:43:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:43:16,464 INFO L93 Difference]: Finished difference Result 1021 states and 1156 transitions. [2024-11-11 15:43:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-11 15:43:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.619047619047619) internal successors, (68), 42 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) Word has length 125 [2024-11-11 15:43:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:43:16,468 INFO L225 Difference]: With dead ends: 1021 [2024-11-11 15:43:16,468 INFO L226 Difference]: Without dead ends: 845 [2024-11-11 15:43:16,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5560 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3896, Invalid=12874, Unknown=0, NotChecked=0, Total=16770 [2024-11-11 15:43:16,475 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2450 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2450 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 15:43:16,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2450 Valid, 329 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 15:43:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-11 15:43:16,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 665. [2024-11-11 15:43:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.177710843373494) internal successors, (782), 664 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:43:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 782 transitions. [2024-11-11 15:43:16,553 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 782 transitions. Word has length 125 [2024-11-11 15:43:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:43:16,554 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 782 transitions. [2024-11-11 15:43:16,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.619047619047619) internal successors, (68), 42 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-11-11 15:43:16,554 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 782 transitions. [2024-11-11 15:43:16,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-11-11 15:43:16,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:43:16,560 INFO L218 NwaCegarLoop]: trace histogram [308, 28, 28, 28, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:43:16,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 15:43:16,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:16,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:43:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:43:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1242132070, now seen corresponding path program 5 times [2024-11-11 15:43:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:43:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524777276] [2024-11-11 15:43:16,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:43:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:43:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:43:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 57170 backedges. 3923 proven. 66 refuted. 0 times theorem prover too weak. 53181 trivial. 0 not checked. [2024-11-11 15:43:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:43:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524777276] [2024-11-11 15:43:18,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524777276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:43:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955849279] [2024-11-11 15:43:18,800 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 15:43:18,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:43:18,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:43:18,802 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-11-11 15:43:18,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process