/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:03:14,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:03:14,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:03:14,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:03:14,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:03:14,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:03:14,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:03:14,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:03:14,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:03:14,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:03:14,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:03:14,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:03:14,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:03:14,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:03:14,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:03:14,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:03:14,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:03:14,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:03:14,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:03:14,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:03:14,565 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:03:14,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:03:14,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:03:14,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:03:14,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:03:14,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:03:14,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:03:14,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:03:14,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:03:14,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:03:14,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:03:14,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:03:14,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:03:14,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:03:14,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:03:14,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:03:14,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:03:14,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:03:14,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:03:14,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:03:14,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:03:14,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:03:14,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:03:14,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:03:14,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:03:14,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:03:14,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:03:14,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:03:14,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:03:14,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:03:14,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:03:14,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:03:14,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:03:14,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:03:14,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:03:14,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:14,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:03:14,591 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:03:14,591 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 12:03:14,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:03:14,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:03:14,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:03:14,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:03:14,816 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:03:14,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-2.i [2022-04-15 12:03:14,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9744170c/8afc25bf25bd4793a1881142500f4dc0/FLAG55280f062 [2022-04-15 12:03:15,244 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:03:15,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i [2022-04-15 12:03:15,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9744170c/8afc25bf25bd4793a1881142500f4dc0/FLAG55280f062 [2022-04-15 12:03:15,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9744170c/8afc25bf25bd4793a1881142500f4dc0 [2022-04-15 12:03:15,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:03:15,262 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:03:15,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:15,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:03:15,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:03:15,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fbac0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15, skipping insertion in model container [2022-04-15 12:03:15,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:03:15,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:03:15,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-15 12:03:15,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:15,428 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:03:15,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-2.i[849,862] [2022-04-15 12:03:15,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:15,447 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:03:15,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15 WrapperNode [2022-04-15 12:03:15,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:15,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:03:15,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:03:15,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:03:15,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:03:15,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:03:15,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:03:15,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:03:15,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (1/1) ... [2022-04-15 12:03:15,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:15,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:15,509 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 12:03:15,510 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 12:03:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:03:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:03:15,533 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:03:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:03:15,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:03:15,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:03:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:03:15,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:03:15,578 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:03:15,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:03:15,671 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:03:15,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:03:15,676 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:03:15,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:15 BoogieIcfgContainer [2022-04-15 12:03:15,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:03:15,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:03:15,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:03:15,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:03:15,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:15" (1/3) ... [2022-04-15 12:03:15,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539ff2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:15, skipping insertion in model container [2022-04-15 12:03:15,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:15" (2/3) ... [2022-04-15 12:03:15,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539ff2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:15, skipping insertion in model container [2022-04-15 12:03:15,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:15" (3/3) ... [2022-04-15 12:03:15,683 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-2.i [2022-04-15 12:03:15,686 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:03:15,687 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:03:15,729 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:03:15,734 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 12:03:15,741 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:03:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 12:03:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:03:15,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:15,768 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:15,768 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 1 times [2022-04-15 12:03:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1722346630] [2022-04-15 12:03:15,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash -241432906, now seen corresponding path program 2 times [2022-04-15 12:03:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:15,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932073787] [2022-04-15 12:03:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:16,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:16,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(10, 2); {23#true} is VALID [2022-04-15 12:03:16,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:03:16,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-15 12:03:16,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:16,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(10, 2); {23#true} is VALID [2022-04-15 12:03:16,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:03:16,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2022-04-15 12:03:16,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-15 12:03:16,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 12:03:16,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 12:03:16,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 12:03:16,109 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {29#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:16,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {30#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:16,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:03:16,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:03:16,112 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 12:03:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:16,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932073787] [2022-04-15 12:03:16,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932073787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:16,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:16,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:03:16,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:16,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1722346630] [2022-04-15 12:03:16,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1722346630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:16,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:16,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:03:16,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721654607] [2022-04-15 12:03:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:16,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,148 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 12:03:16,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:03:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:03:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:03:16,169 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:16,451 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-15 12:03:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:03:16,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 12:03:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 12:03:16,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-15 12:03:16,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:16,523 INFO L225 Difference]: With dead ends: 39 [2022-04-15 12:03:16,523 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:03:16,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:03:16,528 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:16,529 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:03:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:03:16,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:16,571 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 12:03:16,572 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 12:03:16,572 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 12:03:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:16,576 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:03:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:03:16,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:16,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:16,577 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 12:03:16,577 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 12:03:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:16,580 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:03:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:03:16,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:16,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:16,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:16,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:16,581 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 12:03:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:03:16,588 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-15 12:03:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:16,589 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:03:16,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 12:03:16,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:03:16,604 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 12:03:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:03:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:03:16,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:16,611 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:16,612 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:03:16,612 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1042759188, now seen corresponding path program 1 times [2022-04-15 12:03:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:16,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318701487] [2022-04-15 12:03:16,805 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2056142408, now seen corresponding path program 1 times [2022-04-15 12:03:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591531404] [2022-04-15 12:03:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:16,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:16,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:17,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#(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(10, 2); {180#true} is VALID [2022-04-15 12:03:17,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 12:03:17,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-15 12:03:17,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:17,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#(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(10, 2); {180#true} is VALID [2022-04-15 12:03:17,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2022-04-15 12:03:17,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2022-04-15 12:03:17,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret3 := main(); {180#true} is VALID [2022-04-15 12:03:17,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~i~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1;~sn~0 := 0; {185#(= main_~sn~0 0)} is VALID [2022-04-15 12:03:17,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:17,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [50] L25-3-->L25-4_primed: Formula: (or (and (= v_main_~sn~0_In_1 v_main_~sn~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2)) (let ((.cse0 (* (- 1) v_main_~sn~0_In_1))) (and (<= 0 (div (+ .cse0 v_main_~sn~0_Out_2) 2)) (= (mod (+ v_main_~sn~0_In_1 v_main_~sn~0_Out_2) 2) 0) (= (* v_main_~n~0_In_1 2) 0) (= (+ .cse0 (* v_main_~i~0_In_1 2)) (+ (* v_main_~i~0_Out_2 2) (* (- 1) v_main_~sn~0_Out_2))) (= (* |v_main_#t~post2_Out_2| 2) 0) (<= v_main_~i~0_Out_2 (+ v_main_~n~0_In_1 1))))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~sn~0=v_main_~sn~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_#t~post2=|v_main_#t~post2_Out_2|, main_~n~0=v_main_~n~0_In_1, main_~sn~0=v_main_~sn~0_Out_2} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {187#(and (<= main_~sn~0 0) (or (<= (* main_~i~0 2) (+ 2 (* main_~n~0 2) main_~sn~0)) (< 0 (+ main_~sn~0 1))))} is VALID [2022-04-15 12:03:17,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(and (<= main_~sn~0 0) (or (<= (* main_~i~0 2) (+ 2 (* main_~n~0 2) main_~sn~0)) (< 0 (+ main_~sn~0 1))))} [49] L25-4_primed-->L25-4: Formula: (not (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {185#(= main_~sn~0 0)} is VALID [2022-04-15 12:03:17,015 INFO L272 TraceCheckUtils]: 9: Hoare triple {185#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {188#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:17,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {189#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:17,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {181#false} is VALID [2022-04-15 12:03:17,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-04-15 12:03:17,016 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 12:03:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:17,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591531404] [2022-04-15 12:03:17,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591531404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:17,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:17,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:17,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:17,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318701487] [2022-04-15 12:03:17,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318701487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:17,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:17,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:03:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176353429] [2022-04-15 12:03:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:17,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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 12:03:17,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:17,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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 12:03:17,144 WARN L143 InductivityCheck]: Transition 192#(and (= (+ (- 2) main_~i~0) 0) (<= main_~i~0 (+ main_~n~0 1)) (= 2 main_~sn~0)) ( _ , assume !(~i~0 <= ~n~0); , 185#(= main_~sn~0 0) ) not inductive [2022-04-15 12:03:17,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:03:17,144 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:03:17,148 INFO L158 Benchmark]: Toolchain (without parser) took 1885.84ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 159.7MB in the beginning and 214.5MB in the end (delta: -54.9MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. [2022-04-15 12:03:17,148 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory was 175.9MB in the beginning and 175.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:17,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.27ms. Allocated memory is still 209.7MB. Free memory was 159.4MB in the beginning and 185.2MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:03:17,152 INFO L158 Benchmark]: Boogie Preprocessor took 28.88ms. Allocated memory is still 209.7MB. Free memory was 185.2MB in the beginning and 183.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:17,152 INFO L158 Benchmark]: RCFGBuilder took 199.42ms. Allocated memory is still 209.7MB. Free memory was 183.9MB in the beginning and 173.4MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:03:17,152 INFO L158 Benchmark]: TraceAbstraction took 1469.01ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 172.6MB in the beginning and 215.1MB in the end (delta: -42.5MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:17,154 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.13ms. Allocated memory is still 209.7MB. Free memory was 175.9MB in the beginning and 175.8MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.27ms. Allocated memory is still 209.7MB. Free memory was 159.4MB in the beginning and 185.2MB in the end (delta: -25.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.88ms. Allocated memory is still 209.7MB. Free memory was 185.2MB in the beginning and 183.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 199.42ms. Allocated memory is still 209.7MB. Free memory was 183.9MB in the beginning and 173.4MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1469.01ms. Allocated memory was 209.7MB in the beginning and 268.4MB in the end (delta: 58.7MB). Free memory was 172.6MB in the beginning and 215.1MB in the end (delta: -42.5MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:03:17,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...