./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 21:58:36,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 21:58:36,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 21:58:36,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 21:58:36,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 21:58:36,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 21:58:36,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 21:58:36,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 21:58:36,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 21:58:36,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 21:58:36,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 21:58:36,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 21:58:36,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 21:58:36,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 21:58:36,514 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 21:58:36,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 21:58:36,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 21:58:36,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 21:58:36,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 21:58:36,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 21:58:36,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 21:58:36,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 21:58:36,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 21:58:36,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 21:58:36,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 21:58:36,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 21:58:36,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 21:58:36,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 21:58:36,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 21:58:36,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 21:58:36,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 21:58:36,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 21:58:36,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:36,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 21:58:36,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 21:58:36,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 21:58:36,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 21:58:36,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 21:58:36,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 21:58:36,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 21:58:36,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 21:58:36,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 21:58:36,525 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2024-10-10 21:58:36,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 21:58:36,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 21:58:36,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 21:58:36,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 21:58:36,857 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 21:58:36,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-10-10 21:58:38,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 21:58:38,467 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 21:58:38,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-10-10 21:58:38,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3908ce78/0fa3ad0c9b3b445eb2c2d28bb04cb0a6/FLAGba24f8880 [2024-10-10 21:58:38,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3908ce78/0fa3ad0c9b3b445eb2c2d28bb04cb0a6 [2024-10-10 21:58:38,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 21:58:38,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 21:58:38,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:38,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 21:58:38,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 21:58:38,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eae507d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38, skipping insertion in model container [2024-10-10 21:58:38,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 21:58:38,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2024-10-10 21:58:38,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:38,739 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 21:58:38,768 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i[1465,1478] [2024-10-10 21:58:38,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:38,790 INFO L204 MainTranslator]: Completed translation [2024-10-10 21:58:38,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38 WrapperNode [2024-10-10 21:58:38,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:38,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:38,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 21:58:38,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 21:58:38,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,836 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-10-10 21:58:38,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:38,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 21:58:38,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 21:58:38,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 21:58:38,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,872 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-10-10 21:58:38,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 21:58:38,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 21:58:38,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 21:58:38,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 21:58:38,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (1/1) ... [2024-10-10 21:58:38,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:38,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 21:58:38,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 21:58:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 21:58:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 21:58:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 21:58:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 21:58:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 21:58:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 21:58:39,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 21:58:39,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 21:58:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 21:58:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 21:58:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-10-10 21:58:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-10-10 21:58:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 21:58:39,094 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 21:58:39,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 21:58:39,321 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-10 21:58:39,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 21:58:39,362 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 21:58:39,362 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 21:58:39,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:39 BoogieIcfgContainer [2024-10-10 21:58:39,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 21:58:39,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 21:58:39,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 21:58:39,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 21:58:39,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 09:58:38" (1/3) ... [2024-10-10 21:58:39,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435305c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:39, skipping insertion in model container [2024-10-10 21:58:39,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:38" (2/3) ... [2024-10-10 21:58:39,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435305c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:39, skipping insertion in model container [2024-10-10 21:58:39,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:39" (3/3) ... [2024-10-10 21:58:39,375 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2024-10-10 21:58:39,392 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 21:58:39,392 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 21:58:39,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 21:58:39,469 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;@faf6dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 21:58:39,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 21:58:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 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-10-10 21:58:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 21:58:39,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:39,483 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] [2024-10-10 21:58:39,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:39,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1502132506, now seen corresponding path program 1 times [2024-10-10 21:58:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:39,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544377109] [2024-10-10 21:58:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-10 21:58:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-10 21:58:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 21:58:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 21:58:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544377109] [2024-10-10 21:58:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544377109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 21:58:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856283123] [2024-10-10 21:58:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:39,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:39,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:39,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:58:39,971 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-10 21:58:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:40,009 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2024-10-10 21:58:40,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:40,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 28 [2024-10-10 21:58:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:40,020 INFO L225 Difference]: With dead ends: 45 [2024-10-10 21:58:40,021 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 21:58:40,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 21:58:40,027 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:40,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 21:58:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-10 21:58:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-10-10 21:58:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-10 21:58:40,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2024-10-10 21:58:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:40,068 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-10 21:58:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-10 21:58:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-10 21:58:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 21:58:40,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:40,070 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-10-10 21:58:40,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 21:58:40,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -432814053, now seen corresponding path program 1 times [2024-10-10 21:58:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618195621] [2024-10-10 21:58:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:58:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-10 21:58:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 21:58:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:40,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618195621] [2024-10-10 21:58:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618195621] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63843242] [2024-10-10 21:58:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:40,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:40,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 21:58:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 21:58:40,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 21:58:40,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:40,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63843242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:40,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:40,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-10-10 21:58:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554352738] [2024-10-10 21:58:40,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:40,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:40,476 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10-10 21:58:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:40,507 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-10-10 21:58:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 29 [2024-10-10 21:58:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:40,508 INFO L225 Difference]: With dead ends: 42 [2024-10-10 21:58:40,510 INFO L226 Difference]: Without dead ends: 25 [2024-10-10 21:58:40,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-10-10 21:58:40,511 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:40,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-10 21:58:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-10-10 21:58:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-10-10 21:58:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-10 21:58:40,521 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2024-10-10 21:58:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:40,522 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-10 21:58:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10-10 21:58:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-10 21:58:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 21:58:40,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:40,525 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] [2024-10-10 21:58:40,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 21:58:40,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:40,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:40,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash 28977858, now seen corresponding path program 1 times [2024-10-10 21:58:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289006593] [2024-10-10 21:58:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 21:58:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 21:58:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289006593] [2024-10-10 21:58:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289006593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447784041] [2024-10-10 21:58:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:40,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:40,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:40,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:40,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 21:58:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:40,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 21:58:40,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:58:40,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:40,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447784041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:40,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:40,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 21:58:40,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431504924] [2024-10-10 21:58:40,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:40,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:41,002 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-10 21:58:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:41,021 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-10-10 21:58:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 38 [2024-10-10 21:58:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:41,024 INFO L225 Difference]: With dead ends: 40 [2024-10-10 21:58:41,025 INFO L226 Difference]: Without dead ends: 25 [2024-10-10 21:58:41,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-10-10 21:58:41,026 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:41,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-10 21:58:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-10 21:58:41,033 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-10-10 21:58:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-10-10 21:58:41,034 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 38 [2024-10-10 21:58:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:41,036 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-10-10 21:58:41,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-10 21:58:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-10-10 21:58:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 21:58:41,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:41,038 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] [2024-10-10 21:58:41,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 21:58:41,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:41,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2098863663, now seen corresponding path program 1 times [2024-10-10 21:58:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:41,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152565809] [2024-10-10 21:58:41,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 21:58:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152565809] [2024-10-10 21:58:41,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152565809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649842306] [2024-10-10 21:58:41,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:41,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:41,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:41,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:41,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 21:58:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:41,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-10 21:58:41,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:41,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649842306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:41,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:41,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 21:58:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102439674] [2024-10-10 21:58:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:41,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 21:58:41,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 21:58:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:41,495 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-10 21:58:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:41,517 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-10-10 21:58:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 21:58:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 39 [2024-10-10 21:58:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:41,520 INFO L225 Difference]: With dead ends: 49 [2024-10-10 21:58:41,520 INFO L226 Difference]: Without dead ends: 29 [2024-10-10 21:58:41,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-10-10 21:58:41,522 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:41,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-10 21:58:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-10 21:58:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-10-10 21:58:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-10 21:58:41,534 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 39 [2024-10-10 21:58:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:41,534 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-10 21:58:41,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-10 21:58:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-10 21:58:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 21:58:41,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:41,536 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] [2024-10-10 21:58:41,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:41,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:41,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1976122640, now seen corresponding path program 1 times [2024-10-10 21:58:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074071272] [2024-10-10 21:58:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-10 21:58:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 21:58:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074071272] [2024-10-10 21:58:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074071272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:41,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622484306] [2024-10-10 21:58:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:41,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:41,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:41,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:41,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 21:58:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:41,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:41,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:41,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622484306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:41,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2024-10-10 21:58:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528803229] [2024-10-10 21:58:41,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:41,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 21:58:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 21:58:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 21:58:41,992 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-10 21:58:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:42,016 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-10-10 21:58:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:58:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 39 [2024-10-10 21:58:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:42,017 INFO L225 Difference]: With dead ends: 58 [2024-10-10 21:58:42,017 INFO L226 Difference]: Without dead ends: 32 [2024-10-10 21:58:42,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 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-10-10 21:58:42,019 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:42,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-10 21:58:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-10 21:58:42,026 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-10-10 21:58:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-10 21:58:42,029 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 39 [2024-10-10 21:58:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:42,029 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-10 21:58:42,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-10 21:58:42,030 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-10 21:58:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 21:58:42,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:42,031 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 21:58:42,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 21:58:42,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:42,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:42,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash -71399842, now seen corresponding path program 2 times [2024-10-10 21:58:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:42,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826554766] [2024-10-10 21:58:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:42,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 21:58:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:42,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 21:58:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 21:58:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 21:58:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826554766] [2024-10-10 21:58:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826554766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143142005] [2024-10-10 21:58:42,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:42,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:42,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:42,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 21:58:42,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:42,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:42,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 21:58:42,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:42,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 21:58:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143142005] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:42,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:42,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2024-10-10 21:58:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817751778] [2024-10-10 21:58:42,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:42,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 21:58:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:42,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 21:58:42,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-10 21:58:42,646 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-10-10 21:58:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:42,707 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2024-10-10 21:58:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 21:58:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 42 [2024-10-10 21:58:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:42,709 INFO L225 Difference]: With dead ends: 68 [2024-10-10 21:58:42,709 INFO L226 Difference]: Without dead ends: 42 [2024-10-10 21:58:42,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-10 21:58:42,712 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:42,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-10 21:58:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-10 21:58:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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-10-10 21:58:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-10 21:58:42,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-10-10 21:58:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:42,723 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-10 21:58:42,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-10-10 21:58:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-10 21:58:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 21:58:42,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:42,725 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 21:58:42,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 21:58:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:42,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:42,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1756456273, now seen corresponding path program 3 times [2024-10-10 21:58:42,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:42,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013083109] [2024-10-10 21:58:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 21:58:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 21:58:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-10 21:58:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-10 21:58:43,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013083109] [2024-10-10 21:58:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013083109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:43,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97151207] [2024-10-10 21:58:43,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 21:58:43,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:43,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:43,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:43,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 21:58:43,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 21:58:43,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:43,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:43,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-10 21:58:43,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97151207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:43,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-10-10 21:58:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843260569] [2024-10-10 21:58:43,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:43,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:58:43,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:58:43,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:43,104 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-10 21:58:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:43,128 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2024-10-10 21:58:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:58:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 57 [2024-10-10 21:58:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:43,130 INFO L225 Difference]: With dead ends: 71 [2024-10-10 21:58:43,130 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 21:58:43,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:43,131 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:43,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 21:58:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-10-10 21:58:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-10-10 21:58:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-10 21:58:43,136 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 57 [2024-10-10 21:58:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-10 21:58:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-10 21:58:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-10 21:58:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-10 21:58:43,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:43,138 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 21:58:43,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:43,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-10 21:58:43,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:43,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 882234655, now seen corresponding path program 1 times [2024-10-10 21:58:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986469141] [2024-10-10 21:58:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 21:58:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:58:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-10 21:58:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-10 21:58:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986469141] [2024-10-10 21:58:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986469141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933756170] [2024-10-10 21:58:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:43,454 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:43,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 21:58:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:43,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 21:58:43,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-10 21:58:43,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-10 21:58:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933756170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:43,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-10-10 21:58:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380812151] [2024-10-10 21:58:43,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:43,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 21:58:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 21:58:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:58:43,656 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-10-10 21:58:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:43,709 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2024-10-10 21:58:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 21:58:43,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 66 [2024-10-10 21:58:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:43,724 INFO L225 Difference]: With dead ends: 77 [2024-10-10 21:58:43,725 INFO L226 Difference]: Without dead ends: 52 [2024-10-10 21:58:43,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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-10-10 21:58:43,726 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:43,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-10 21:58:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-10 21:58:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 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-10-10 21:58:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-10-10 21:58:43,738 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 66 [2024-10-10 21:58:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-10-10 21:58:43,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-10-10 21:58:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-10-10 21:58:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-10 21:58:43,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:43,740 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 10, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:43,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:43,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:43,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 208391406, now seen corresponding path program 2 times [2024-10-10 21:58:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526902248] [2024-10-10 21:58:43,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 21:58:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-10 21:58:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-10 21:58:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2024-10-10 21:58:44,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526902248] [2024-10-10 21:58:44,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526902248] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314026356] [2024-10-10 21:58:44,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:44,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:44,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:44,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 21:58:44,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:44,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:44,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 21:58:44,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-10 21:58:44,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-10-10 21:58:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314026356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:44,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 15 [2024-10-10 21:58:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654749444] [2024-10-10 21:58:44,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:44,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 21:58:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 21:58:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-10-10 21:58:44,420 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-10-10 21:58:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:44,488 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2024-10-10 21:58:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 21:58:44,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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 103 [2024-10-10 21:58:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:44,490 INFO L225 Difference]: With dead ends: 100 [2024-10-10 21:58:44,490 INFO L226 Difference]: Without dead ends: 62 [2024-10-10 21:58:44,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 196 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-10-10 21:58:44,493 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:44,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-10 21:58:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-10 21:58:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 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-10-10 21:58:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2024-10-10 21:58:44,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 103 [2024-10-10 21:58:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:44,503 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2024-10-10 21:58:44,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 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-10-10 21:58:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2024-10-10 21:58:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-10 21:58:44,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:44,509 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:44,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:44,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:44,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1351345104, now seen corresponding path program 3 times [2024-10-10 21:58:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327777115] [2024-10-10 21:58:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:44,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 21:58:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-10 21:58:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-10 21:58:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2024-10-10 21:58:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327777115] [2024-10-10 21:58:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327777115] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913333288] [2024-10-10 21:58:44,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 21:58:44,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:45,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:45,001 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:45,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 21:58:45,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-10 21:58:45,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:45,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 21:58:45,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 650 proven. 6 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2024-10-10 21:58:45,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2024-10-10 21:58:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913333288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:45,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-10 21:58:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586591040] [2024-10-10 21:58:45,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 21:58:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 21:58:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-10-10 21:58:45,197 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-10-10 21:58:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:45,218 INFO L93 Difference]: Finished difference Result 108 states and 127 transitions. [2024-10-10 21:58:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 21:58:45,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 131 [2024-10-10 21:58:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:45,220 INFO L225 Difference]: With dead ends: 108 [2024-10-10 21:58:45,220 INFO L226 Difference]: Without dead ends: 67 [2024-10-10 21:58:45,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 263 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-10-10 21:58:45,221 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:45,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-10 21:58:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-10 21:58:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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-10-10 21:58:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2024-10-10 21:58:45,227 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 131 [2024-10-10 21:58:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:45,227 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2024-10-10 21:58:45,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-10-10 21:58:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2024-10-10 21:58:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-10 21:58:45,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:45,229 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:45,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:45,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:45,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:45,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1820390537, now seen corresponding path program 4 times [2024-10-10 21:58:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892040962] [2024-10-10 21:58:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:45,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 21:58:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-10 21:58:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:45,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-10 21:58:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2024-10-10 21:58:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892040962] [2024-10-10 21:58:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892040962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031937058] [2024-10-10 21:58:45,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 21:58:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:45,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:45,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 21:58:45,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 21:58:45,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:45,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 21:58:45,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2024-10-10 21:58:45,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2024-10-10 21:58:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031937058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:46,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:46,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2024-10-10 21:58:46,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822929326] [2024-10-10 21:58:46,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:46,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 21:58:46,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 21:58:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-10 21:58:46,069 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-10-10 21:58:46,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:46,096 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-10-10 21:58:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 21:58:46,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 136 [2024-10-10 21:58:46,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:46,098 INFO L225 Difference]: With dead ends: 109 [2024-10-10 21:58:46,098 INFO L226 Difference]: Without dead ends: 68 [2024-10-10 21:58:46,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 268 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-10-10 21:58:46,099 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:46,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-10 21:58:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-10 21:58:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 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-10-10 21:58:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2024-10-10 21:58:46,105 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 136 [2024-10-10 21:58:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:46,105 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2024-10-10 21:58:46,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-10-10 21:58:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2024-10-10 21:58:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-10 21:58:46,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:46,107 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:46,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-10 21:58:46,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 21:58:46,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:46,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:46,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1194088144, now seen corresponding path program 5 times [2024-10-10 21:58:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:46,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191861852] [2024-10-10 21:58:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-10 21:58:46,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [434935570] [2024-10-10 21:58:46,566 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-10 21:58:46,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:46,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:46,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 21:58:46,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 21:58:50,776 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-10-10 21:58:50,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-10 21:58:50,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 21:58:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 21:58:51,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 21:58:51,076 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 21:58:51,077 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 21:58:51,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-10 21:58:51,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 21:58:51,282 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2024-10-10 21:58:51,363 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 21:58:51,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 09:58:51 BoogieIcfgContainer [2024-10-10 21:58:51,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 21:58:51,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 21:58:51,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 21:58:51,368 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 21:58:51,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:39" (3/4) ... [2024-10-10 21:58:51,369 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 21:58:51,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 21:58:51,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 21:58:51,472 INFO L158 Benchmark]: Toolchain (without parser) took 12977.61ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 104.7MB in the beginning and 105.9MB in the end (delta: -1.2MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,472 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 21:58:51,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.42ms. Allocated memory is still 144.7MB. Free memory was 104.1MB in the beginning and 91.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.74ms. Allocated memory is still 144.7MB. Free memory was 91.4MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,473 INFO L158 Benchmark]: Boogie Preprocessor took 61.95ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,473 INFO L158 Benchmark]: RCFGBuilder took 464.61ms. Allocated memory is still 144.7MB. Free memory was 87.3MB in the beginning and 72.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,474 INFO L158 Benchmark]: TraceAbstraction took 12000.24ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 71.9MB in the beginning and 114.4MB in the end (delta: -42.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,474 INFO L158 Benchmark]: Witness Printer took 104.29ms. Allocated memory is still 209.7MB. Free memory was 114.4MB in the beginning and 105.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 21:58:51,475 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.17ms. Allocated memory is still 109.1MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.42ms. Allocated memory is still 144.7MB. Free memory was 104.1MB in the beginning and 91.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.74ms. Allocated memory is still 144.7MB. Free memory was 91.4MB in the beginning and 89.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.95ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.61ms. Allocated memory is still 144.7MB. Free memory was 87.3MB in the beginning and 72.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12000.24ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 71.9MB in the beginning and 114.4MB in the end (delta: -42.5MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 104.29ms. Allocated memory is still 209.7MB. Free memory was 114.4MB in the beginning and 105.9MB 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=2147483645, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=2147483645, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=2147483645, 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=4294967291, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=4294967291, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=4294967291, 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=2147483650, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=2147483650, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=2147483650, 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=4294967297, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=4294967297, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=4294967297, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=1073741824, 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=2147483645, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=2147483645, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=2147483645, 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=4294967291, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=4294967291, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=4294967291, 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=2147483650, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=2147483650, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=2147483650, 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=4294967297, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=4294967297, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=4294967297, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=1073741824, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=1073741824, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, 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=1073741824, ret=1073741824, temp=2147483643, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [ret2=1073741824, ret=1073741824, temp=2147483643, 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=2147483646, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=2147483646, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=2147483646, 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=5, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=5, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=5, 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=2147483652, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=2147483652, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=2147483652, 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=4294967295, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=4294967295, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=4294967295, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=1073741823, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=1073741824, ret=1073741824, 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.8s, OverallIterations: 12, TraceHistogramMax: 30, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 761 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 515 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287 IncrementalHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 246 mSDtfsCounter, 287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1300 GetRequests, 1216 SyntacticMatches, 15 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1662 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1878 ConstructedInterpolants, 0 QuantifiedInterpolants, 2164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2237 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 11765/12522 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-10-10 21:58:51,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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