/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:09:09,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:09:09,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:09:09,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:09:09,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:09:09,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:09:09,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:09:09,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:09:09,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:09:09,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:09:09,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:09:09,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:09:09,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:09:09,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:09:09,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:09:09,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:09:09,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:09:09,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:09:09,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:09:09,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:09:09,366 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:09:09,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:09:09,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:09:09,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:09:09,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:09:09,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:09:09,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:09:09,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:09:09,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:09:09,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:09:09,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:09:09,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:09:09,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:09:09,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:09:09,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:09:09,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:09:09,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:09:09,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:09:09,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:09:09,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:09:09,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:09:09,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:09:09,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:09:09,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:09:09,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:09:09,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:09:09,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:09:09,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:09:09,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:09:09,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:09:09,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:09:09,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:09:09,383 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:09:09,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:09:09,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:09:09,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:09:09,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:09:09,567 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:09:09,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i [2022-04-15 07:09:09,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35470a57/08cb3923f7464403acb5f9d1677a3d83/FLAGcb977fed0 [2022-04-15 07:09:09,936 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:09:09,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i [2022-04-15 07:09:09,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35470a57/08cb3923f7464403acb5f9d1677a3d83/FLAGcb977fed0 [2022-04-15 07:09:10,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35470a57/08cb3923f7464403acb5f9d1677a3d83 [2022-04-15 07:09:10,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:09:10,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:09:10,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:09:10,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:09:10,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:09:10,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b92e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10, skipping insertion in model container [2022-04-15 07:09:10,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:09:10,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:09:10,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i[873,886] [2022-04-15 07:09:10,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:09:10,588 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:09:10,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark09_conjunctive.i[873,886] [2022-04-15 07:09:10,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:09:10,625 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:09:10,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10 WrapperNode [2022-04-15 07:09:10,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:09:10,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:09:10,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:09:10,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:09:10,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:09:10,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:09:10,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:09:10,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:09:10,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (1/1) ... [2022-04-15 07:09:10,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:09:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:09:10,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:09:10,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:09:10,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:09:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:09:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:09:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:09:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 07:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 07:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:09:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:09:10,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:09:10,748 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:09:10,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:09:10,877 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:09:10,882 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:09:10,882 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:09:10,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:09:10 BoogieIcfgContainer [2022-04-15 07:09:10,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:09:10,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:09:10,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:09:10,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:09:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:09:10" (1/3) ... [2022-04-15 07:09:10,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaaa2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:09:10, skipping insertion in model container [2022-04-15 07:09:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:09:10" (2/3) ... [2022-04-15 07:09:10,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eaaa2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:09:10, skipping insertion in model container [2022-04-15 07:09:10,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:09:10" (3/3) ... [2022-04-15 07:09:10,898 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark09_conjunctive.i [2022-04-15 07:09:10,901 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:09:10,901 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:09:10,956 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:09:10,960 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 07:09:10,961 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:09:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:09:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:09:10,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:10,981 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:10,982 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 1 times [2022-04-15 07:09:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:10,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879791726] [2022-04-15 07:09:11,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:09:11,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 2 times [2022-04-15 07:09:11,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:11,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871535494] [2022-04-15 07:09:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:11,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:11,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-04-15 07:09:11,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 07:09:11,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-15 07:09:11,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:11,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-04-15 07:09:11,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 07:09:11,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-15 07:09:11,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-15 07:09:11,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-15 07:09:11,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {29#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 07:09:11,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (or (<= main_~y~0 0) (<= main_~y~0 main_~x~0)) (< 0 (+ main_~y~0 1)))} assume !(0 != ~x~0); {30#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 07:09:11,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:09:11,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:09:11,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-15 07:09:11,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 07:09:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:09:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:11,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871535494] [2022-04-15 07:09:11,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871535494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:11,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:11,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:09:11,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:11,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879791726] [2022-04-15 07:09:11,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879791726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:11,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:11,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:09:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878771017] [2022-04-15 07:09:11,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:09:11,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:11,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:11,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:09:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:09:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:09:11,296 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:11,592 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 07:09:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:09:11,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 07:09:11,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-15 07:09:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-15 07:09:11,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-15 07:09:11,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:11,642 INFO L225 Difference]: With dead ends: 42 [2022-04-15 07:09:11,642 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 07:09:11,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:09:11,646 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:11,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 47 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:09:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 07:09:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 07:09:11,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:11,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,666 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,666 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:11,668 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 07:09:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 07:09:11,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:11,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:11,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 07:09:11,669 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 07:09:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:11,670 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 07:09:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 07:09:11,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:11,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:11,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:11,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 07:09:11,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 07:09:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:11,673 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 07:09:11,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 07:09:11,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 07:09:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 07:09:11,685 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:11,685 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:11,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:09:11,686 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 1 times [2022-04-15 07:09:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:11,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724815764] [2022-04-15 07:09:11,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:09:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 2 times [2022-04-15 07:09:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:11,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824580058] [2022-04-15 07:09:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:11,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {190#true} is VALID [2022-04-15 07:09:11,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 07:09:11,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #50#return; {190#true} is VALID [2022-04-15 07:09:11,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:11,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {190#true} is VALID [2022-04-15 07:09:11,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 07:09:11,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #50#return; {190#true} is VALID [2022-04-15 07:09:11,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret5 := main(); {190#true} is VALID [2022-04-15 07:09:11,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {190#true} is VALID [2022-04-15 07:09:11,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {195#(and (or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) (< 0 (+ main_~x~0 1)))} is VALID [2022-04-15 07:09:11,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#(and (or (<= main_~x~0 main_~y~0) (<= main_~x~0 0)) (< 0 (+ main_~x~0 1)))} assume !!(0 != ~x~0);#t~post3 := ~x~0;~x~0 := #t~post3 - 1;havoc #t~post3;#t~post4 := ~y~0;~y~0 := #t~post4 - 1;havoc #t~post4; {196#(and (<= 0 main_~y~0) (<= 0 main_~x~0))} is VALID [2022-04-15 07:09:11,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {196#(and (<= 0 main_~y~0) (<= 0 main_~x~0))} assume ~x~0 < 0 || ~y~0 < 0; {191#false} is VALID [2022-04-15 07:09:11,748 INFO L272 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {191#false} is VALID [2022-04-15 07:09:11,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2022-04-15 07:09:11,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2022-04-15 07:09:11,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-15 07:09:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:09:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824580058] [2022-04-15 07:09:11,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824580058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:11,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:09:11,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:11,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724815764] [2022-04-15 07:09:11,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724815764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:11,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:11,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:09:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269439592] [2022-04-15 07:09:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 07:09:11,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:11,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:11,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:09:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:11,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:09:11,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:09:11,760 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:11,826 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 07:09:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:09:11,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 07:09:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 07:09:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-15 07:09:11,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-15 07:09:11,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:11,842 INFO L225 Difference]: With dead ends: 20 [2022-04-15 07:09:11,842 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 07:09:11,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:09:11,843 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:11,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:09:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 07:09:11,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 07:09:11,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:11,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,852 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,852 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:11,853 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 07:09:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 07:09:11,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:11,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:11,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 07:09:11,853 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 07:09:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:11,854 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 07:09:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 07:09:11,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:11,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:11,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:11,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 07:09:11,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 07:09:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:11,856 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 07:09:11,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:11,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 07:09:11,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 07:09:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 07:09:11,867 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:11,867 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:11,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:09:11,867 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:11,868 INFO L85 PathProgramCache]: Analyzing trace with hash -181933682, now seen corresponding path program 1 times [2022-04-15 07:09:11,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:11,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609345111] [2022-04-15 07:09:12,186 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,188 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1825519308, now seen corresponding path program 1 times [2022-04-15 07:09:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:12,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765144601] [2022-04-15 07:09:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:12,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {302#true} is VALID [2022-04-15 07:09:12,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-15 07:09:12,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {302#true} {302#true} #50#return; {302#true} is VALID [2022-04-15 07:09:12,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {302#true} call ULTIMATE.init(); {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:12,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {302#true} is VALID [2022-04-15 07:09:12,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume true; {302#true} is VALID [2022-04-15 07:09:12,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {302#true} {302#true} #50#return; {302#true} is VALID [2022-04-15 07:09:12,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {302#true} call #t~ret5 := main(); {302#true} is VALID [2022-04-15 07:09:12,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {302#true} is VALID [2022-04-15 07:09:12,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume !!(~x~0 == ~y~0 && ~y~0 >= 0); {307#(and (<= main_~x~0 main_~y~0) (<= 0 main_~x~0) (<= main_~y~0 main_~x~0))} is VALID [2022-04-15 07:09:12,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#(and (<= main_~x~0 main_~y~0) (<= 0 main_~x~0) (<= main_~y~0 main_~x~0))} [54] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse1 (= v_main_~y~0_11 v_main_~y~0_10)) (.cse2 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse3 (= v_main_~x~0_10 v_main_~x~0_9))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_10 v_main_~y~0_10))) (and (< v_main_~y~0_10 v_main_~y~0_11) (= (+ v_main_~y~0_11 v_main_~x~0_9) .cse4) (<= v_main_~y~0_11 .cse4) (<= 0 v_main_~y~0_10))) (and (or (not (<= 1 v_main_~y~0_11)) (not (<= 1 v_main_~x~0_10))) .cse0 .cse1 .cse2 .cse3))) InVars {main_#t~post4=|v_main_#t~post4_4|, main_~y~0=v_main_~y~0_11, main_#t~post3=|v_main_#t~post3_4|, main_~x~0=v_main_~x~0_10} OutVars{main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_10, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {308#(or (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (<= 1 main_~x~0))} is VALID [2022-04-15 07:09:12,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#(or (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (<= 1 main_~x~0))} [53] L23-3_primed-->L23-3: Formula: (= v_main_~x~0_1 0) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {309#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 07:09:12,282 INFO L272 TraceCheckUtils]: 9: Hoare triple {309#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if 0 == ~y~0 then 1 else 0)); {310#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:09:12,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {311#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:09:12,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {303#false} is VALID [2022-04-15 07:09:12,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-04-15 07:09:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:09:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:12,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765144601] [2022-04-15 07:09:12,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765144601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:12,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:12,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:09:12,367 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:12,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609345111] [2022-04-15 07:09:12,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609345111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:12,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:12,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:09:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125454435] [2022-04-15 07:09:12,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 07:09:12,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:12,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:12,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:12,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:09:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:09:12,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:09:12,379 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:12,482 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 07:09:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:09:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 07:09:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-15 07:09:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions. [2022-04-15 07:09:12,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions. [2022-04-15 07:09:12,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:12,495 INFO L225 Difference]: With dead ends: 15 [2022-04-15 07:09:12,495 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:09:12,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:09:12,496 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:12,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:09:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:09:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:09:12,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:12,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:09:12,497 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:09:12,497 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:09:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:12,497 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:09:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:09:12,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:12,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:12,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:09:12,497 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:09:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:12,497 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:09:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:09:12,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:12,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:12,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:12,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:09:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:09:12,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 07:09:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:12,498 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:09:12,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:12,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:09:12,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:09:12,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:12,500 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:09:12,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:09:12,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:09:12,584 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-15 07:09:12,584 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-15 07:09:12,584 INFO L882 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-15 07:09:12,584 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (and (<= main_~x~0 main_~y~0) (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) [2022-04-15 07:09:12,585 INFO L878 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:09:12,585 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:09:12,586 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:09:12,586 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:09:12,586 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-15 07:09:12,586 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:09:12,586 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 07:09:12,586 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 07:09:12,588 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 07:09:12,588 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:09:12,590 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:09:12,591 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:09:12,591 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-15 07:09:12,597 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:09:12,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:09:12 BoogieIcfgContainer [2022-04-15 07:09:12,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:09:12,604 INFO L158 Benchmark]: Toolchain (without parser) took 2250.07ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 137.0MB in the beginning and 162.5MB in the end (delta: -25.4MB). Peak memory consumption was 31.8MB. Max. memory is 8.0GB. [2022-04-15 07:09:12,604 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:09:12,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.05ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 136.8MB in the beginning and 222.8MB in the end (delta: -86.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-15 07:09:12,604 INFO L158 Benchmark]: Boogie Preprocessor took 18.45ms. Allocated memory is still 245.4MB. Free memory was 222.4MB in the beginning and 220.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 07:09:12,604 INFO L158 Benchmark]: RCFGBuilder took 238.11ms. Allocated memory is still 245.4MB. Free memory was 220.8MB in the beginning and 209.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 07:09:12,605 INFO L158 Benchmark]: TraceAbstraction took 1718.74ms. Allocated memory is still 245.4MB. Free memory was 209.3MB in the beginning and 162.5MB in the end (delta: 46.8MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2022-04-15 07:09:12,605 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.05ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 136.8MB in the beginning and 222.8MB in the end (delta: -86.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.45ms. Allocated memory is still 245.4MB. Free memory was 222.4MB in the beginning and 220.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 238.11ms. Allocated memory is still 245.4MB. Free memory was 220.8MB in the beginning and 209.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1718.74ms. Allocated memory is still 245.4MB. Free memory was 209.3MB in the beginning and 162.5MB in the end (delta: 46.8MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 39 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 39 PreInvPairs, 56 NumberOfFragments, 78 HoareAnnotationTreeSize, 39 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (x <= y && 0 <= x) && y <= x - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 07:09:12,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...