./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum20.i -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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:43:51,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:43:51,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 20:43:51,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:43:51,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:43:51,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:43:51,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:43:51,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:43:51,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:43:51,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:43:51,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:43:51,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:43:51,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:43:51,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:43:51,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:43:51,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:43:51,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:43:51,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:43:51,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 20:43:51,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:43:51,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:43:51,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:43:51,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:43:51,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:43:51,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:43:51,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:43:51,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:43:51,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:43:51,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:43:51,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:43:51,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:43:51,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:43:51,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:43:51,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:43:51,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:43:51,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:43:51,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 20:43:51,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 20:43:51,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:43:51,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:43:51,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:43:51,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:43:51,354 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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2024-11-21 20:43:51,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:43:51,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:43:51,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:43:51,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:43:51,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:43:51,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-21 20:43:53,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:43:53,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:43:53,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-21 20:43:53,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4db7ac9/2865fdbd7a4648bea76451837fb6e237/FLAG0c84113bd [2024-11-21 20:43:53,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c4db7ac9/2865fdbd7a4648bea76451837fb6e237 [2024-11-21 20:43:53,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:43:53,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:43:53,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:43:53,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:43:53,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:43:53,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4610367f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53, skipping insertion in model container [2024-11-21 20:43:53,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:43:53,544 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/reducercommutativity/rangesum20.i[1465,1478] [2024-11-21 20:43:53,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:43:53,556 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:43:53,577 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/reducercommutativity/rangesum20.i[1465,1478] [2024-11-21 20:43:53,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:43:53,596 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:43:53,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53 WrapperNode [2024-11-21 20:43:53,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:43:53,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:43:53,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:43:53,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:43:53,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,628 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-21 20:43:53,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:43:53,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:43:53,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:43:53,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:43:53,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,663 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-21 20:43:53,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:43:53,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:43:53,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:43:53,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:43:53,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (1/1) ... [2024-11-21 20:43:53,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:43:53,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:53,722 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-21 20:43:53,726 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-21 20:43:53,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:43:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 20:43:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 20:43:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:43:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-21 20:43:53,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-21 20:43:53,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:43:53,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:43:53,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 20:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 20:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-21 20:43:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-21 20:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:43:53,867 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:43:53,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:43:54,081 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-21 20:43:54,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:43:54,098 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:43:54,098 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-21 20:43:54,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:54 BoogieIcfgContainer [2024-11-21 20:43:54,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:43:54,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:43:54,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:43:54,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:43:54,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:43:53" (1/3) ... [2024-11-21 20:43:54,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4817b567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:43:54, skipping insertion in model container [2024-11-21 20:43:54,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:53" (2/3) ... [2024-11-21 20:43:54,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4817b567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:43:54, skipping insertion in model container [2024-11-21 20:43:54,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:54" (3/3) ... [2024-11-21 20:43:54,110 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2024-11-21 20:43:54,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:43:54,131 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:43:54,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:43:54,220 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;@d80f756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:43:54,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:43:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-21 20:43:54,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:54,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:54,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:54,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2024-11-21 20:43:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:54,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514901202] [2024-11-21 20:43:54,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:54,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514901202] [2024-11-21 20:43:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514901202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:54,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:43:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743599920] [2024-11-21 20:43:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:54,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:54,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:43:54,639 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:54,669 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-11-21 20:43:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-21 20:43:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:54,678 INFO L225 Difference]: With dead ends: 54 [2024-11-21 20:43:54,678 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 20:43:54,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:43:54,684 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:54,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 20:43:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-21 20:43:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-21 20:43:54,718 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-21 20:43:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:54,719 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-21 20:43:54,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-21 20:43:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 20:43:54,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:54,721 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:54,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 20:43:54,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:54,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2024-11-21 20:43:54,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:54,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923860142] [2024-11-21 20:43:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:54,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 20:43:54,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:54,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923860142] [2024-11-21 20:43:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923860142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052041761] [2024-11-21 20:43:54,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:54,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:54,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:54,891 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-21 20:43:54,894 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-21 20:43:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:55,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 20:43:55,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:55,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:43:55,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:55,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052041761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:55,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:55,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:43:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28845048] [2024-11-21 20:43:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:55,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:55,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:55,056 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:55,092 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-21 20:43:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:55,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-21 20:43:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:55,094 INFO L225 Difference]: With dead ends: 46 [2024-11-21 20:43:55,094 INFO L226 Difference]: Without dead ends: 28 [2024-11-21 20:43:55,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:55,096 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:55,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-21 20:43:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-21 20:43:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-21 20:43:55,109 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-11-21 20:43:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:55,110 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-21 20:43:55,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-21 20:43:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-21 20:43:55,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:55,113 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:55,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 20:43:55,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:55,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:55,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2024-11-21 20:43:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205264846] [2024-11-21 20:43:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-21 20:43:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205264846] [2024-11-21 20:43:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205264846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765680566] [2024-11-21 20:43:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:55,478 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-21 20:43:55,482 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-21 20:43:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:55,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 20:43:55,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 20:43:55,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765680566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:43:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875073044] [2024-11-21 20:43:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:55,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:55,593 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:55,613 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-21 20:43:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-21 20:43:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:55,615 INFO L225 Difference]: With dead ends: 44 [2024-11-21 20:43:55,615 INFO L226 Difference]: Without dead ends: 29 [2024-11-21 20:43:55,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:55,618 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:55,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-21 20:43:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-21 20:43:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:55,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-21 20:43:55,627 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2024-11-21 20:43:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:55,631 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-21 20:43:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-21 20:43:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-21 20:43:55,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:55,632 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:55,643 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-21 20:43:55,837 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,SelfDestructingSolverStorable2 [2024-11-21 20:43:55,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:55,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2024-11-21 20:43:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:55,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978406980] [2024-11-21 20:43:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:55,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:55,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978406980] [2024-11-21 20:43:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978406980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073946584] [2024-11-21 20:43:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:55,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:55,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:55,977 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-21 20:43:55,979 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-21 20:43:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:56,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:43:56,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-21 20:43:56,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073946584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:43:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684880126] [2024-11-21 20:43:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:56,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:56,117 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:56,127 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-21 20:43:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-21 20:43:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:56,129 INFO L225 Difference]: With dead ends: 53 [2024-11-21 20:43:56,129 INFO L226 Difference]: Without dead ends: 32 [2024-11-21 20:43:56,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:56,130 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:56,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-21 20:43:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-21 20:43:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-21 20:43:56,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2024-11-21 20:43:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:56,138 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-21 20:43:56,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 20:43:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-21 20:43:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-21 20:43:56,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:56,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:56,146 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-21 20:43:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:56,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:56,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2024-11-21 20:43:56,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:56,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366634329] [2024-11-21 20:43:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:56,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:56,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:56,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366634329] [2024-11-21 20:43:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366634329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176870591] [2024-11-21 20:43:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:56,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:56,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:56,421 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-21 20:43:56,422 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-21 20:43:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:56,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:43:56,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:56,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176870591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:56,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:56,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-21 20:43:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941756792] [2024-11-21 20:43:56,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:56,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 20:43:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:56,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 20:43:56,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 20:43:56,596 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-21 20:43:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:56,669 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-11-21 20:43:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 20:43:56,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-11-21 20:43:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:56,675 INFO L225 Difference]: With dead ends: 65 [2024-11-21 20:43:56,675 INFO L226 Difference]: Without dead ends: 38 [2024-11-21 20:43:56,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 20:43:56,676 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:56,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 103 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-21 20:43:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-21 20:43:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-21 20:43:56,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 42 [2024-11-21 20:43:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:56,703 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-21 20:43:56,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-21 20:43:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-21 20:43:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 20:43:56,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:56,706 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:56,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 20:43:56,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:56,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:56,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:56,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1775617261, now seen corresponding path program 2 times [2024-11-21 20:43:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625222037] [2024-11-21 20:43:56,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:56,933 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:56,933 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-21 20:43:56,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625222037] [2024-11-21 20:43:56,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625222037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256021412] [2024-11-21 20:43:56,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:56,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:56,997 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-21 20:43:56,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 20:43:57,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:57,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:57,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 20:43:57,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:57,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-21 20:43:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256021412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:57,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-21 20:43:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271094442] [2024-11-21 20:43:57,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:57,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 20:43:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:57,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 20:43:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-21 20:43:57,248 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:57,340 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2024-11-21 20:43:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-21 20:43:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-21 20:43:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:57,341 INFO L225 Difference]: With dead ends: 81 [2024-11-21 20:43:57,341 INFO L226 Difference]: Without dead ends: 54 [2024-11-21 20:43:57,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-21 20:43:57,343 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:57,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 157 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-21 20:43:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-21 20:43:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-11-21 20:43:57,351 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 48 [2024-11-21 20:43:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:57,351 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-11-21 20:43:57,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-21 20:43:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-21 20:43:57,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:57,353 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:57,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 20:43:57,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:57,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:57,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 335937760, now seen corresponding path program 3 times [2024-11-21 20:43:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:57,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690806666] [2024-11-21 20:43:57,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:57,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-21 20:43:57,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-11-21 20:43:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:57,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690806666] [2024-11-21 20:43:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690806666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:43:57,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824364343] [2024-11-21 20:43:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:57,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:43:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:43:57,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:43:57,606 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:57,624 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-21 20:43:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:43:57,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2024-11-21 20:43:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:57,626 INFO L225 Difference]: With dead ends: 84 [2024-11-21 20:43:57,626 INFO L226 Difference]: Without dead ends: 56 [2024-11-21 20:43:57,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:43:57,627 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:57,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-21 20:43:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-21 20:43:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-21 20:43:57,635 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 69 [2024-11-21 20:43:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:57,636 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-21 20:43:57,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 20:43:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-21 20:43:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-21 20:43:57,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:57,637 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:57,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 20:43:57,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:57,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2024-11-21 20:43:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325156518] [2024-11-21 20:43:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-21 20:43:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325156518] [2024-11-21 20:43:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325156518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383587635] [2024-11-21 20:43:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:57,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:57,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:57,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:57,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 20:43:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:57,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-21 20:43:57,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-21 20:43:57,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-21 20:43:58,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383587635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:58,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 24 [2024-11-21 20:43:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276613357] [2024-11-21 20:43:58,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:58,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-21 20:43:58,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:58,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-21 20:43:58,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-21 20:43:58,268 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-21 20:43:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:58,385 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2024-11-21 20:43:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-21 20:43:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-21 20:43:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:58,386 INFO L225 Difference]: With dead ends: 102 [2024-11-21 20:43:58,386 INFO L226 Difference]: Without dead ends: 74 [2024-11-21 20:43:58,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-21 20:43:58,388 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:58,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 209 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-21 20:43:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-21 20:43:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-21 20:43:58,398 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 78 [2024-11-21 20:43:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:58,398 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-21 20:43:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-21 20:43:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-21 20:43:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-21 20:43:58,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:58,400 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:58,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 20:43:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:58,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1718843700, now seen corresponding path program 2 times [2024-11-21 20:43:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:58,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436728354] [2024-11-21 20:43:58,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:58,672 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:58,673 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-21 20:43:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436728354] [2024-11-21 20:43:58,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436728354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:58,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905834822] [2024-11-21 20:43:58,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:58,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:58,794 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:58,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 20:43:58,918 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:58,918 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:58,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:43:58,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-21 20:43:58,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-21 20:43:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905834822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:58,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-21 20:43:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792019075] [2024-11-21 20:43:58,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:58,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 20:43:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 20:43:58,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-21 20:43:58,998 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:43:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:59,034 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2024-11-21 20:43:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 20:43:59,043 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-21 20:43:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:59,044 INFO L225 Difference]: With dead ends: 113 [2024-11-21 20:43:59,044 INFO L226 Difference]: Without dead ends: 85 [2024-11-21 20:43:59,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-21 20:43:59,045 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:59,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:59,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-21 20:43:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-21 20:43:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-21 20:43:59,057 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 100 [2024-11-21 20:43:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:59,057 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-21 20:43:59,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:43:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-21 20:43:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-21 20:43:59,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:59,060 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:59,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-21 20:43:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:59,261 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1145442804, now seen corresponding path program 3 times [2024-11-21 20:43:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930678582] [2024-11-21 20:43:59,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:59,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-21 20:43:59,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-21 20:43:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930678582] [2024-11-21 20:43:59,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930678582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:59,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239335715] [2024-11-21 20:43:59,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:59,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:59,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:59,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 20:43:59,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-21 20:43:59,485 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:59,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:43:59,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-21 20:43:59,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-21 20:43:59,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239335715] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:59,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-21 20:43:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853190112] [2024-11-21 20:43:59,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:59,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:43:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:43:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:59,580 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:43:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:59,645 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2024-11-21 20:43:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 20:43:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 136 [2024-11-21 20:43:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:59,647 INFO L225 Difference]: With dead ends: 140 [2024-11-21 20:43:59,647 INFO L226 Difference]: Without dead ends: 100 [2024-11-21 20:43:59,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:59,648 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:59,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-21 20:43:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-21 20:43:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0957446808510638) internal successors, (103), 94 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:43:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2024-11-21 20:43:59,657 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 136 [2024-11-21 20:43:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2024-11-21 20:43:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:43:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2024-11-21 20:43:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-21 20:43:59,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:59,659 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 20, 20, 18, 15, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:43:59,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-21 20:43:59,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-21 20:43:59,864 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:59,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1504654094, now seen corresponding path program 4 times [2024-11-21 20:43:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:59,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475740334] [2024-11-21 20:43:59,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:43:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:59,906 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:43:59,906 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2107 backedges. 93 proven. 835 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2024-11-21 20:44:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:44:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475740334] [2024-11-21 20:44:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475740334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:44:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004420714] [2024-11-21 20:44:00,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:44:00,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:44:00,040 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:44:00,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 20:44:00,168 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:44:00,168 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:00,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 20:44:00,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:44:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2107 backedges. 549 proven. 57 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2024-11-21 20:44:00,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:44:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2107 backedges. 93 proven. 835 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2024-11-21 20:44:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004420714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:44:00,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:44:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-21 20:44:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195716557] [2024-11-21 20:44:00,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:44:00,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-21 20:44:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:44:00,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-21 20:44:00,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-21 20:44:00,322 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:44:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:44:00,369 INFO L93 Difference]: Finished difference Result 168 states and 194 transitions. [2024-11-21 20:44:00,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-21 20:44:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 174 [2024-11-21 20:44:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:44:00,371 INFO L225 Difference]: With dead ends: 168 [2024-11-21 20:44:00,371 INFO L226 Difference]: Without dead ends: 114 [2024-11-21 20:44:00,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 341 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-21 20:44:00,372 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:44:00,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:44:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-21 20:44:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-21 20:44:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.0825688073394495) internal successors, (118), 109 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:44:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2024-11-21 20:44:00,388 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 174 [2024-11-21 20:44:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:44:00,389 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2024-11-21 20:44:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:44:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2024-11-21 20:44:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-21 20:44:00,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:44:00,392 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 33, 20, 20, 15, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:44:00,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-21 20:44:00,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:00,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:44:00,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:44:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1277623577, now seen corresponding path program 5 times [2024-11-21 20:44:00,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:44:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971417946] [2024-11-21 20:44:00,595 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:44:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:44:00,628 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-21 20:44:00,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3952 backedges. 181 proven. 602 refuted. 0 times theorem prover too weak. 3169 trivial. 0 not checked. [2024-11-21 20:44:00,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:44:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971417946] [2024-11-21 20:44:00,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971417946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:44:00,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440635200] [2024-11-21 20:44:00,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:44:00,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:00,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:44:00,717 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:44:00,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 20:44:00,844 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-21 20:44:00,844 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:00,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-21 20:44:00,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:44:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3952 backedges. 1785 proven. 40 refuted. 0 times theorem prover too weak. 2127 trivial. 0 not checked. [2024-11-21 20:44:00,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:44:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3952 backedges. 181 proven. 602 refuted. 0 times theorem prover too weak. 3169 trivial. 0 not checked. [2024-11-21 20:44:00,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440635200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:44:00,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:44:00,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2024-11-21 20:44:00,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388051239] [2024-11-21 20:44:00,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:44:00,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-21 20:44:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:44:00,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-21 20:44:00,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:44:00,979 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:44:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:44:01,022 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2024-11-21 20:44:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-21 20:44:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 219 [2024-11-21 20:44:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:44:01,024 INFO L225 Difference]: With dead ends: 195 [2024-11-21 20:44:01,024 INFO L226 Difference]: Without dead ends: 126 [2024-11-21 20:44:01,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 431 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:44:01,025 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:44:01,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:44:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-21 20:44:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-21 20:44:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 121 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:44:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2024-11-21 20:44:01,034 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 219 [2024-11-21 20:44:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:44:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2024-11-21 20:44:01,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 20:44:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2024-11-21 20:44:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-21 20:44:01,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:44:01,037 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:44:01,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-21 20:44:01,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-21 20:44:01,238 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:44:01,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:44:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash -575874009, now seen corresponding path program 6 times [2024-11-21 20:44:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:44:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942963808] [2024-11-21 20:44:01,239 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 20:44:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:44:01,362 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-21 20:44:01,363 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-21 20:44:01,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:44:01,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942963808] [2024-11-21 20:44:01,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942963808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:44:01,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39444842] [2024-11-21 20:44:01,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-21 20:44:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:44:01,464 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:44:01,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-21 20:44:01,620 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-21 20:44:01,621 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:01,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-21 20:44:01,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:44:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 2490 proven. 9 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-21 20:44:01,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:44:01,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-21 20:44:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39444842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:44:01,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:44:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-21 20:44:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407880858] [2024-11-21 20:44:01,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:44:01,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:44:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:44:01,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:44:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:44:01,721 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:44:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:44:01,761 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2024-11-21 20:44:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 20:44:01,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 255 [2024-11-21 20:44:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:44:01,763 INFO L225 Difference]: With dead ends: 207 [2024-11-21 20:44:01,763 INFO L226 Difference]: Without dead ends: 136 [2024-11-21 20:44:01,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:44:01,764 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:44:01,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:44:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-21 20:44:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-21 20:44:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.099236641221374) internal successors, (144), 131 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:44:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-21 20:44:01,781 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 255 [2024-11-21 20:44:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:44:01,781 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-21 20:44:01,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:44:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-21 20:44:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-21 20:44:01,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:44:01,784 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:44:01,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-21 20:44:01,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-21 20:44:01,985 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:44:01,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:44:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -545735139, now seen corresponding path program 7 times [2024-11-21 20:44:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:44:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142355614] [2024-11-21 20:44:01,987 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-21 20:44:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:44:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:44:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-21 20:44:02,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:44:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142355614] [2024-11-21 20:44:02,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142355614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:44:02,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998292317] [2024-11-21 20:44:02,462 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-21 20:44:02,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:02,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:44:02,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:44:02,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-21 20:44:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:44:02,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 20:44:02,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:44:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 2490 proven. 64 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-21 20:44:02,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:44:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-21 20:44:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998292317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:44:02,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:44:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-21 20:44:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277566605] [2024-11-21 20:44:02,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:44:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-21 20:44:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:44:02,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-21 20:44:02,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-21 20:44:02,905 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:44:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:44:02,962 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2024-11-21 20:44:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-21 20:44:02,962 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 265 [2024-11-21 20:44:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:44:02,964 INFO L225 Difference]: With dead ends: 227 [2024-11-21 20:44:02,964 INFO L226 Difference]: Without dead ends: 156 [2024-11-21 20:44:02,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-21 20:44:02,965 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:44:02,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:44:02,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-21 20:44:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-21 20:44:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.086092715231788) internal successors, (164), 151 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:44:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-21 20:44:02,976 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 265 [2024-11-21 20:44:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:44:02,977 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-21 20:44:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:44:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-21 20:44:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-21 20:44:02,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:44:02,981 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:44:02,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-21 20:44:03,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-21 20:44:03,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:44:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:44:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 762343305, now seen corresponding path program 8 times [2024-11-21 20:44:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:44:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438428470] [2024-11-21 20:44:03,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:44:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:44:03,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:44:03,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-21 20:44:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:44:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438428470] [2024-11-21 20:44:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438428470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:44:04,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138013727] [2024-11-21 20:44:04,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:44:04,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:04,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:44:04,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:44:04,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-21 20:44:04,394 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:44:04,395 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:44:04,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-21 20:44:04,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:44:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 2490 proven. 324 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-21 20:44:04,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:44:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-21 20:44:04,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138013727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:44:04,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:44:04,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 22 [2024-11-21 20:44:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43630406] [2024-11-21 20:44:04,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:44:04,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-21 20:44:04,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:44:04,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-21 20:44:04,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-21 20:44:04,721 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:44:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:44:04,779 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2024-11-21 20:44:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-21 20:44:04,780 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 285 [2024-11-21 20:44:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:44:04,781 INFO L225 Difference]: With dead ends: 229 [2024-11-21 20:44:04,781 INFO L226 Difference]: Without dead ends: 158 [2024-11-21 20:44:04,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 550 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-21 20:44:04,782 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:44:04,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:44:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-21 20:44:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-21 20:44:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 153 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-21 20:44:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2024-11-21 20:44:04,788 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 285 [2024-11-21 20:44:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:44:04,789 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2024-11-21 20:44:04,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 20:44:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2024-11-21 20:44:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-21 20:44:04,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:44:04,792 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:44:04,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-21 20:44:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-21 20:44:04,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:44:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:44:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1541531655, now seen corresponding path program 9 times [2024-11-21 20:44:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:44:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026538032] [2024-11-21 20:44:04,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:44:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:44:06,776 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2024-11-21 20:44:06,777 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-21 20:44:06,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357395663] [2024-11-21 20:44:06,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:44:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:44:06,791 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:44:06,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-21 20:44:24,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2024-11-21 20:44:24,075 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-21 20:44:24,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 20:44:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 20:44:30,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 20:44:30,076 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 20:44:30,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 20:44:30,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-21 20:44:30,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:44:30,282 INFO L407 BasicCegarLoop]: Path program histogram: [9, 3, 1, 1, 1, 1] [2024-11-21 20:44:30,423 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 20:44:30,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:44:30 BoogieIcfgContainer [2024-11-21 20:44:30,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 20:44:30,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 20:44:30,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 20:44:30,427 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 20:44:30,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:54" (3/4) ... [2024-11-21 20:44:30,430 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 20:44:30,555 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 20:44:30,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 20:44:30,556 INFO L158 Benchmark]: Toolchain (without parser) took 37239.98ms. Allocated memory was 155.2MB in the beginning and 268.4MB in the end (delta: 113.2MB). Free memory was 100.2MB in the beginning and 185.1MB in the end (delta: -84.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-21 20:44:30,556 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 20:44:30,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.92ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 87.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 20:44:30,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:44:30,557 INFO L158 Benchmark]: Boogie Preprocessor took 53.84ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 83.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:44:30,557 INFO L158 Benchmark]: RCFGBuilder took 414.47ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 70.2MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 20:44:30,558 INFO L158 Benchmark]: TraceAbstraction took 36324.57ms. Allocated memory was 155.2MB in the beginning and 268.4MB in the end (delta: 113.2MB). Free memory was 69.8MB in the beginning and 199.9MB in the end (delta: -130.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 20:44:30,558 INFO L158 Benchmark]: Witness Printer took 128.81ms. Allocated memory is still 268.4MB. Free memory was 199.9MB in the beginning and 185.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 20:44:30,560 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.92ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 87.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.84ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 83.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.47ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 70.2MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 36324.57ms. Allocated memory was 155.2MB in the beginning and 268.4MB in the end (delta: 113.2MB). Free memory was 69.8MB in the beginning and 199.9MB in the end (delta: -130.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 128.81ms. Allocated memory is still 268.4MB. Free memory was 199.9MB in the beginning and 185.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}] [L17] COND FALSE !(i < 20) VAL [x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=-2147483635, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483635, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483635, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=9, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=9, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=9, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=2147483656, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=2147483656, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=2147483656, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=23, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=23, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=23, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-1073741816, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-1073741816, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-1073741816, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=-2147483657, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-2147483657, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=-2147483657, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=-11, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-11, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=-11, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=2147483636, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483636, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483636, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-10, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-10, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-10, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=-2147483635, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483635, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=-2147483635, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=9, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=9, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=9, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=2147483656, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=2147483656, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=2147483656, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=23, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=23, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=23, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-1073741816, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-1073741816, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-1073741816, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=-2147483657, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=-2147483657, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=-2147483657, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=-11, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=-11, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=-11, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=2147483636, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483636, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483636, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-10, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-10, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-10, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-1, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L54] COND FALSE !(i<20 -1) VAL [ret2=-1, ret=-1, temp=-2147483647, x={3:0}] [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=7, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=9, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={3:0}, cnt=0, i=10, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=0, i=11, ret=0, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=11, ret=2147483644, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=12, ret=2147483644, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=1, i=12, ret=2147483644, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=12, ret=4294967291, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=13, ret=4294967291, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=2, i=13, ret=4294967291, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=13, ret=2147483658, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=14, ret=2147483658, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=3, i=14, ret=2147483658, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=14, ret=1073741819, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=15, ret=1073741819, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=4, i=15, ret=1073741819, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=5, i=15, ret=-22, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=5, i=16, ret=-22, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=5, i=16, ret=-22, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=6, i=16, ret=2147483624, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=6, i=17, ret=2147483624, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=6, i=17, ret=2147483624, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=7, i=17, ret=4294967271, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=7, i=18, ret=4294967271, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=7, i=18, ret=4294967271, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=8, i=18, ret=2147483625, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483625, x={3:0}] [L28] COND TRUE i < 20 VAL [\old(x)={3:0}, cnt=8, i=19, ret=2147483625, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=9, i=19, ret=-22, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=9, i=20, ret=-22, x={3:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={3:0}, cnt=9, ret=-22, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-1, ret=-1, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.1s, OverallIterations: 16, TraceHistogramMax: 60, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 1345 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 937 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 408 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3391 GetRequests, 3227 SyntacticMatches, 28 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=15, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 19.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 4102 NumberOfCodeBlocks, 2994 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 5092 ConstructedInterpolants, 0 QuantifiedInterpolants, 5948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3815 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 74286/78883 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-21 20:44:30,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE