./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.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/rangesum10.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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:43:44,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:43:45,059 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:45,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:43:45,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:43:45,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:43:45,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:43:45,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:43:45,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:43:45,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:43:45,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:43:45,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:43:45,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:43:45,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:43:45,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:43:45,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:43:45,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:43:45,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:43:45,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 20:43:45,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:43:45,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:43:45,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:43:45,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:43:45,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:43:45,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:43:45,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:43:45,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:43:45,102 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:43:45,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:43:45,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:43:45,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:43:45,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:43:45,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:43:45,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:43:45,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:43:45,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:43:45,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 20:43:45,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 20:43:45,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:43:45,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:43:45,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:43:45,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:43:45,106 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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2024-11-21 20:43:45,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:43:45,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:43:45,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:43:45,317 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:43:45,318 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:43:45,319 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-21 20:43:46,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:43:46,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:43:46,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-21 20:43:46,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658431853/a4b99cf914874b31ac4e1d1902d1e540/FLAG4f008fa0f [2024-11-21 20:43:47,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/658431853/a4b99cf914874b31ac4e1d1902d1e540 [2024-11-21 20:43:47,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:43:47,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:43:47,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:43:47,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:43:47,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:43:47,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:43:47" (1/1) ... [2024-11-21 20:43:47,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7fb613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:47, skipping insertion in model container [2024-11-21 20:43:47,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:43:47" (1/1) ... [2024-11-21 20:43:47,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:43:47,300 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/rangesum10.i[1465,1478] [2024-11-21 20:43:47,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:43:47,315 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:43:47,338 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/rangesum10.i[1465,1478] [2024-11-21 20:43:47,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:43:47,356 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:43:47,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:47 WrapperNode [2024-11-21 20:43:47,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:43:47,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:43:47,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:43:47,358 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:43:47,364 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:47" (1/1) ... [2024-11-21 20:43:47,371 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:47" (1/1) ... [2024-11-21 20:43:47,389 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-21 20:43:47,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:43:47,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:43:47,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:43:47,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:43:47,399 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:47" (1/1) ... [2024-11-21 20:43:47,399 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:47" (1/1) ... [2024-11-21 20:43:47,401 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:47" (1/1) ... [2024-11-21 20:43:47,415 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:47,416 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:47" (1/1) ... [2024-11-21 20:43:47,416 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:47" (1/1) ... [2024-11-21 20:43:47,420 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:47" (1/1) ... [2024-11-21 20:43:47,425 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:47" (1/1) ... [2024-11-21 20:43:47,426 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:47" (1/1) ... [2024-11-21 20:43:47,428 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:47" (1/1) ... [2024-11-21 20:43:47,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:43:47,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:43:47,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:43:47,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:43:47,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:47" (1/1) ... [2024-11-21 20:43:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:43:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:47,462 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:47,465 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:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:43:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 20:43:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 20:43:47,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:43:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-21 20:43:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-21 20:43:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:43:47,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:43:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 20:43:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 20:43:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-21 20:43:47,509 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-21 20:43:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:43:47,570 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:43:47,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:43:47,756 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-21 20:43:47,756 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:43:47,769 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:43:47,777 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-21 20:43:47,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:47 BoogieIcfgContainer [2024-11-21 20:43:47,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:43:47,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:43:47,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:43:47,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:43:47,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:43:47" (1/3) ... [2024-11-21 20:43:47,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69208f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:43:47, skipping insertion in model container [2024-11-21 20:43:47,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:43:47" (2/3) ... [2024-11-21 20:43:47,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69208f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:43:47, skipping insertion in model container [2024-11-21 20:43:47,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:43:47" (3/3) ... [2024-11-21 20:43:47,788 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2024-11-21 20:43:47,803 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:43:47,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:43:47,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:43:47,858 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;@3cd6b8a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:43:47,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:43:47,862 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:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-21 20:43:47,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:47,868 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:47,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:47,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2024-11-21 20:43:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10167754] [2024-11-21 20:43:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,150 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:48,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10167754] [2024-11-21 20:43:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10167754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:43:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571556059] [2024-11-21 20:43:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:48,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:43:48,180 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:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:48,206 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-11-21 20:43:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:48,209 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:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:48,214 INFO L225 Difference]: With dead ends: 54 [2024-11-21 20:43:48,214 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 20:43:48,217 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:48,219 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:48,220 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:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 20:43:48,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-21 20:43:48,244 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:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-21 20:43:48,247 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-21 20:43:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:48,247 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-21 20:43:48,247 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:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-21 20:43:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 20:43:48,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:48,248 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:48,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 20:43:48,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:48,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2024-11-21 20:43:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287670421] [2024-11-21 20:43:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,373 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:48,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:48,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287670421] [2024-11-21 20:43:48,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287670421] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:48,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679445471] [2024-11-21 20:43:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:48,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:48,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:48,376 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:48,382 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:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 20:43:48,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:48,512 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:48,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679445471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:48,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:48,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:43:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655712002] [2024-11-21 20:43:48,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:48,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:48,521 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:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:48,538 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-21 20:43:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:48,540 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:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:48,541 INFO L225 Difference]: With dead ends: 46 [2024-11-21 20:43:48,541 INFO L226 Difference]: Without dead ends: 28 [2024-11-21 20:43:48,541 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:48,542 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:48,543 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:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-21 20:43:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-21 20:43:48,549 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:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-21 20:43:48,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-11-21 20:43:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:48,552 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-21 20:43:48,552 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:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-21 20:43:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-21 20:43:48,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:48,555 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:48,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-21 20:43:48,755 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:48,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:48,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2024-11-21 20:43:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140905851] [2024-11-21 20:43:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,883 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:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140905851] [2024-11-21 20:43:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140905851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:48,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285739623] [2024-11-21 20:43:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:48,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:48,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:48,887 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:48,889 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:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:48,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 20:43:48,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:48,979 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:48,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285739623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:43:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891183781] [2024-11-21 20:43:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:48,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:48,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:48,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:48,984 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:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:49,000 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-21 20:43:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:49,000 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:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:49,002 INFO L225 Difference]: With dead ends: 44 [2024-11-21 20:43:49,002 INFO L226 Difference]: Without dead ends: 29 [2024-11-21 20:43:49,002 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:49,004 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:49,004 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:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-21 20:43:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-21 20:43:49,010 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:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-21 20:43:49,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2024-11-21 20:43:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:49,013 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-21 20:43:49,013 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:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-21 20:43:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-21 20:43:49,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:49,014 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:49,022 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:49,219 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:49,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:49,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2024-11-21 20:43:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53043725] [2024-11-21 20:43:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:49,289 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:49,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53043725] [2024-11-21 20:43:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53043725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273489505] [2024-11-21 20:43:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:49,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:49,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:43:49,294 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:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:49,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:43:49,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:49,381 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:49,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:43:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273489505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:49,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 20:43:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-21 20:43:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565532127] [2024-11-21 20:43:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:49,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:43:49,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:49,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:43:49,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 20:43:49,383 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:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:49,390 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-21 20:43:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:43:49,393 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:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:49,394 INFO L225 Difference]: With dead ends: 53 [2024-11-21 20:43:49,394 INFO L226 Difference]: Without dead ends: 32 [2024-11-21 20:43:49,395 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:49,396 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:49,397 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:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-21 20:43:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-21 20:43:49,403 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:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-21 20:43:49,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2024-11-21 20:43:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:49,404 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-21 20:43:49,404 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:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-21 20:43:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-21 20:43:49,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:49,405 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:49,413 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:49,610 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:49,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:49,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2024-11-21 20:43:49,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:49,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266048959] [2024-11-21 20:43:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:49,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:49,669 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:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:49,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266048959] [2024-11-21 20:43:49,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266048959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:49,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44061328] [2024-11-21 20:43:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:49,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:49,672 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:49,679 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:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:49,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:43:49,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:49,772 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:49,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:49,818 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:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44061328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:49,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-21 20:43:49,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105839325] [2024-11-21 20:43:49,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:49,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 20:43:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:49,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 20:43:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 20:43:49,820 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:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:49,852 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-11-21 20:43:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 20:43:49,853 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:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:49,853 INFO L225 Difference]: With dead ends: 65 [2024-11-21 20:43:49,854 INFO L226 Difference]: Without dead ends: 38 [2024-11-21 20:43:49,854 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:49,855 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.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:49,856 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.0s Time] [2024-11-21 20:43:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-21 20:43:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-21 20:43:49,861 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:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-11-21 20:43:49,865 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 42 [2024-11-21 20:43:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:49,865 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-11-21 20:43:49,865 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:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-11-21 20:43:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 20:43:49,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:49,866 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:49,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-21 20:43:50,067 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:50,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:50,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1775617261, now seen corresponding path program 2 times [2024-11-21 20:43:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047450797] [2024-11-21 20:43:50,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:50,082 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:50,082 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:50,127 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:50,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047450797] [2024-11-21 20:43:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047450797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590708034] [2024-11-21 20:43:50,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:50,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:50,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:50,131 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:50,132 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:50,192 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:50,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:50,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 20:43:50,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:50,241 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:50,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:50,326 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:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590708034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:50,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:50,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-21 20:43:50,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774530969] [2024-11-21 20:43:50,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 20:43:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:50,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 20:43:50,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-21 20:43:50,328 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:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:50,392 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2024-11-21 20:43:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-21 20:43:50,392 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:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:50,393 INFO L225 Difference]: With dead ends: 81 [2024-11-21 20:43:50,393 INFO L226 Difference]: Without dead ends: 54 [2024-11-21 20:43:50,394 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:50,394 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:50,394 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:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-21 20:43:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-21 20:43:50,398 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:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-11-21 20:43:50,399 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 48 [2024-11-21 20:43:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:50,399 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-11-21 20:43:50,400 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:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-21 20:43:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-21 20:43:50,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:50,401 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:50,407 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:50,601 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:50,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 335937760, now seen corresponding path program 3 times [2024-11-21 20:43:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:50,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489943871] [2024-11-21 20:43:50,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:50,621 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-21 20:43:50,623 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:50,652 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:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489943871] [2024-11-21 20:43:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489943871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:43:50,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:43:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:43:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505716052] [2024-11-21 20:43:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:43:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:43:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:50,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:43:50,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:43:50,655 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:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:50,675 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-21 20:43:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:43:50,675 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:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:50,678 INFO L225 Difference]: With dead ends: 84 [2024-11-21 20:43:50,678 INFO L226 Difference]: Without dead ends: 56 [2024-11-21 20:43:50,679 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:50,679 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:50,679 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:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-21 20:43:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-21 20:43:50,689 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:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-21 20:43:50,690 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 69 [2024-11-21 20:43:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:50,690 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-21 20:43:50,690 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:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-21 20:43:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-21 20:43:50,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:50,691 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:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 20:43:50,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:50,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2024-11-21 20:43:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021785730] [2024-11-21 20:43:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:50,786 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:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:50,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021785730] [2024-11-21 20:43:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021785730] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:50,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705930390] [2024-11-21 20:43:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:43:50,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:50,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:50,789 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:50,790 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:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:43:50,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:43:50,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-21 20:43:50,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-21 20:43:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705930390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:50,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-21 20:43:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556745491] [2024-11-21 20:43:50,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:50,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 20:43:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 20:43:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:43:50,945 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:50,989 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2024-11-21 20:43:50,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 20:43:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2024-11-21 20:43:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:50,991 INFO L225 Difference]: With dead ends: 92 [2024-11-21 20:43:50,991 INFO L226 Difference]: Without dead ends: 66 [2024-11-21 20:43:50,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:43:50,993 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:50,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-21 20:43:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-21 20:43:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 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:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-21 20:43:51,001 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 78 [2024-11-21 20:43:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:51,001 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-21 20:43:51,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-21 20:43:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-21 20:43:51,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:51,002 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 10, 10, 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:51,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-21 20:43:51,203 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:51,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -142865288, now seen corresponding path program 2 times [2024-11-21 20:43:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935977638] [2024-11-21 20:43:51,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:51,245 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:51,247 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-21 20:43:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935977638] [2024-11-21 20:43:51,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935977638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202783963] [2024-11-21 20:43:51,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:43:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:51,330 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:51,331 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:51,419 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:43:51,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:51,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-21 20:43:51,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-21 20:43:51,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-21 20:43:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202783963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:51,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:51,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 15 [2024-11-21 20:43:51,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287436745] [2024-11-21 20:43:51,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-21 20:43:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-21 20:43:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-21 20:43:51,591 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:51,650 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2024-11-21 20:43:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 20:43:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-11-21 20:43:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:51,652 INFO L225 Difference]: With dead ends: 117 [2024-11-21 20:43:51,652 INFO L226 Difference]: Without dead ends: 77 [2024-11-21 20:43:51,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-21 20:43:51,653 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:51,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:43:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-21 20:43:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-21 20:43:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 71 states have internal predecessors, (79), 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:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-21 20:43:51,659 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 116 [2024-11-21 20:43:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:51,659 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-21 20:43:51,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-21 20:43:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-21 20:43:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-21 20:43:51,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:51,660 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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:51,670 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:51,864 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:51,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:51,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash 681168413, now seen corresponding path program 3 times [2024-11-21 20:43:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:51,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729915262] [2024-11-21 20:43:51,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:51,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:51,924 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-21 20:43:51,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-21 20:43:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729915262] [2024-11-21 20:43:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729915262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819750542] [2024-11-21 20:43:51,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:43:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:51,980 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:51,981 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:52,085 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-21 20:43:52,086 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:52,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-21 20:43:52,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 650 proven. 9 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-21 20:43:52,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-21 20:43:52,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819750542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:52,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:52,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-21 20:43:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014553648] [2024-11-21 20:43:52,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:52,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:43:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:52,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:43:52,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:52,155 INFO L87 Difference]: Start difference. First operand 76 states and 85 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:43:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:52,182 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-21 20:43:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 20:43:52,183 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 145 [2024-11-21 20:43:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:52,184 INFO L225 Difference]: With dead ends: 127 [2024-11-21 20:43:52,184 INFO L226 Difference]: Without dead ends: 86 [2024-11-21 20:43:52,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 285 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:43:52,185 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:52,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:52,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-21 20:43:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-21 20:43:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 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:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-21 20:43:52,190 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 145 [2024-11-21 20:43:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:52,191 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-21 20:43:52,191 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:43:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-21 20:43:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-21 20:43:52,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:52,195 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 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:43:52,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-21 20:43:52,396 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:52,396 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 26761619, now seen corresponding path program 4 times [2024-11-21 20:43:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:52,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640782899] [2024-11-21 20:43:52,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:43:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:52,458 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:43:52,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-21 20:43:52,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:43:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640782899] [2024-11-21 20:43:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640782899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:43:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897518097] [2024-11-21 20:43:52,657 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:43:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:52,659 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:43:52,660 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:43:52,789 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:43:52,789 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:43:52,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 20:43:52,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:43:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-21 20:43:52,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:43:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-21 20:43:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897518097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:43:52,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:43:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2024-11-21 20:43:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884242503] [2024-11-21 20:43:52,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:43:52,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 20:43:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:43:52,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 20:43:52,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:52,893 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:43:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:43:52,915 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-11-21 20:43:52,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 20:43:52,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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 155 [2024-11-21 20:43:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:43:52,917 INFO L225 Difference]: With dead ends: 129 [2024-11-21 20:43:52,917 INFO L226 Difference]: Without dead ends: 88 [2024-11-21 20:43:52,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 301 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-21 20:43:52,918 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:43:52,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:43:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-21 20:43:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-21 20:43:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 83 states have internal predecessors, (91), 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:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-21 20:43:52,926 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 155 [2024-11-21 20:43:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:43:52,927 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-21 20:43:52,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 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:43:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-21 20:43:52,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-21 20:43:52,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:43:52,929 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 9, 9, 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:52,937 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:43:53,129 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:43:53,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:43:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:43:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1925080943, now seen corresponding path program 5 times [2024-11-21 20:43:53,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:43:53,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498769630] [2024-11-21 20:43:53,131 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:43:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:43:53,373 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-11-21 20:43:53,373 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-21 20:43:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751265888] [2024-11-21 20:43:53,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-21 20:43:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:43:53,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:43:53,383 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:43:53,385 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:43:58,668 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-11-21 20:43:58,669 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-21 20:43:58,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 20:43:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 20:43:59,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 20:43:59,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 20:43:59,201 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 20:43:59,228 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:43:59,404 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:43:59,406 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2024-11-21 20:43:59,476 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 20:43:59,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 08:43:59 BoogieIcfgContainer [2024-11-21 20:43:59,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 20:43:59,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 20:43:59,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 20:43:59,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 20:43:59,479 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:47" (3/4) ... [2024-11-21 20:43:59,479 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 20:43:59,539 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 20:43:59,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 20:43:59,540 INFO L158 Benchmark]: Toolchain (without parser) took 12408.54ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 91.6MB in the beginning and 149.7MB in the end (delta: -58.1MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,540 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 20:43:59,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.77ms. Allocated memory is still 146.8MB. Free memory was 91.2MB in the beginning and 78.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.37ms. Allocated memory is still 146.8MB. Free memory was 78.0MB in the beginning and 76.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,540 INFO L158 Benchmark]: Boogie Preprocessor took 39.54ms. Allocated memory is still 146.8MB. Free memory was 76.3MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,541 INFO L158 Benchmark]: RCFGBuilder took 348.10ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 74.2MB in the beginning and 181.3MB in the end (delta: -107.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,541 INFO L158 Benchmark]: TraceAbstraction took 11697.28ms. Allocated memory is still 209.7MB. Free memory was 181.3MB in the beginning and 158.1MB in the end (delta: 23.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,541 INFO L158 Benchmark]: Witness Printer took 61.44ms. Allocated memory is still 209.7MB. Free memory was 158.1MB in the beginning and 149.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 20:43:59,543 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.15ms. Allocated memory is still 146.8MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.77ms. Allocated memory is still 146.8MB. Free memory was 91.2MB in the beginning and 78.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.37ms. Allocated memory is still 146.8MB. Free memory was 78.0MB in the beginning and 76.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.54ms. Allocated memory is still 146.8MB. Free memory was 76.3MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.10ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 74.2MB in the beginning and 181.3MB in the end (delta: -107.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11697.28ms. Allocated memory is still 209.7MB. Free memory was 181.3MB in the beginning and 158.1MB in the end (delta: 23.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Witness Printer took 61.44ms. Allocated memory is still 209.7MB. Free memory was 158.1MB in the beginning and 149.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND FALSE !(i < 10) 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 < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-2, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-3, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-3, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-3, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-3, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-13, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-13, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-13, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, 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 < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-2, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-3, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-3, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-3, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-3, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-3, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-13, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-13, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-13, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-3, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-3, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-3, ret=-3, temp=-5, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [ret2=-3, ret=-3, temp=-5, x={3:0}] [L57] x[10 -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 < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/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 < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-11, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-11, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-11, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-16, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-16, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-16, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-4, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-3, ret=-3, 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: 11.6s, OverallIterations: 12, TraceHistogramMax: 30, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 898 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 599 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 299 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 1236 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=11, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1806 NumberOfCodeBlocks, 1588 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 2050 ConstructedInterpolants, 0 QuantifiedInterpolants, 2430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2145 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 12248/13087 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:43:59,574 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