/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/loop-invgen/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:30:31,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:30:31,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:30:31,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:30:31,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:30:31,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:30:31,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:30:31,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:30:31,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:30:31,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:30:31,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:30:31,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:30:31,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:30:31,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:30:31,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:30:31,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:30:31,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:30:31,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:30:31,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:30:31,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:30:31,589 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:30:31,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:30:31,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:30:31,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:30:31,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:30:31,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:30:31,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:30:31,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:30:31,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:30:31,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:30:31,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:30:31,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:30:31,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:30:31,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:30:31,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:30:31,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:30:31,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:30:31,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:30:31,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:30:31,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:30:31,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:30:31,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:30:31,598 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:30:31,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:30:31,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:30:31,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:30:31,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:30:31,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:30:31,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:30:31,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:30:31,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:30:31,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:30:31,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:30:31,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:30:31,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:30:31,620 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:30:31,620 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:30:31,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:30:31,620 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:30:31,620 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:30:31,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:30:31,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:30:31,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:30:31,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:30:31,839 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:30:31,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2022-04-15 12:30:31,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3956a450/e024978611cd46119b5b67623b92704e/FLAG3aa1a7507 [2022-04-15 12:30:32,240 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:30:32,240 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2022-04-15 12:30:32,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3956a450/e024978611cd46119b5b67623b92704e/FLAG3aa1a7507 [2022-04-15 12:30:32,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3956a450/e024978611cd46119b5b67623b92704e [2022-04-15 12:30:32,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:30:32,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:30:32,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:30:32,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:30:32,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:30:32,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2331b8cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32, skipping insertion in model container [2022-04-15 12:30:32,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:30:32,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:30:32,424 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-invgen/half_2.i[893,906] [2022-04-15 12:30:32,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:30:32,449 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:30:32,462 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-invgen/half_2.i[893,906] [2022-04-15 12:30:32,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:30:32,479 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:30:32,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32 WrapperNode [2022-04-15 12:30:32,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:30:32,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:30:32,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:30:32,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:30:32,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:30:32,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:30:32,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:30:32,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:30:32,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (1/1) ... [2022-04-15 12:30:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:30:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:30:32,545 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:30:32,562 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:30:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:30:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:30:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:30:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:30:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:30:32,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:30:32,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:30:32,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:30:32,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:30:32,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:30:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:30:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:30:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:30:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:30:32,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:30:32,635 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:30:32,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:30:32,778 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:30:32,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:30:32,785 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:30:32,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:30:32 BoogieIcfgContainer [2022-04-15 12:30:32,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:30:32,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:30:32,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:30:32,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:30:32,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:30:32" (1/3) ... [2022-04-15 12:30:32,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b41a36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:30:32, skipping insertion in model container [2022-04-15 12:30:32,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:30:32" (2/3) ... [2022-04-15 12:30:32,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b41a36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:30:32, skipping insertion in model container [2022-04-15 12:30:32,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:30:32" (3/3) ... [2022-04-15 12:30:32,796 INFO L111 eAbstractionObserver]: Analyzing ICFG half_2.i [2022-04-15 12:30:32,800 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:30:32,801 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:30:32,847 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:30:32,857 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:30:32,857 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:30:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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:30:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:30:32,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:32,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:32,886 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:32,890 INFO L85 PathProgramCache]: Analyzing trace with hash 21938802, now seen corresponding path program 1 times [2022-04-15 12:30:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:32,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054469688] [2022-04-15 12:30:32,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:30:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash 21938802, now seen corresponding path program 2 times [2022-04-15 12:30:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:32,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463684505] [2022-04-15 12:30:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:33,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(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(9, 2); {26#true} is VALID [2022-04-15 12:30:33,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:30:33,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-15 12:30:33,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:33,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(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(9, 2); {26#true} is VALID [2022-04-15 12:30:33,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 12:30:33,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #68#return; {26#true} is VALID [2022-04-15 12:30:33,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-15 12:30:33,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26#true} is VALID [2022-04-15 12:30:33,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {31#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:30:33,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(<= main_~n~0 main_~k~0)} assume !(~i~0 < ~n~0); {31#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:30:33,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(<= main_~n~0 main_~k~0)} ~j~0 := 0; {32#(and (= main_~j~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-15 12:30:33,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~j~0 0) (<= main_~n~0 main_~k~0))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {33#(<= 1 main_~k~0)} is VALID [2022-04-15 12:30:33,201 INFO L272 TraceCheckUtils]: 10: Hoare triple {33#(<= 1 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:33,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:33,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-15 12:30:33,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 12:30:33,202 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:30:33,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463684505] [2022-04-15 12:30:33,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463684505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:33,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:33,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:33,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:33,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054469688] [2022-04-15 12:30:33,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054469688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:33,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:33,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:30:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163878558] [2022-04-15 12:30:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:33,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,226 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 12:30:33,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:30:33,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:30:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:30:33,245 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:33,685 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 12:30:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:30:33,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:30:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 12:30:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 12:30:33,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 12:30:33,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:33,755 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:30:33,755 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:30:33,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:30:33,775 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:30:33,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:30:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:30:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 12:30:33,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:30:33,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:30:33,802 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:30:33,802 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:30:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:33,805 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:30:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:30:33,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:33,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:33,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 12:30:33,806 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 12:30:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:30:33,808 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:30:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:30:33,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:30:33,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:30:33,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:30:33,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:30:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:30:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 12:30:33,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2022-04-15 12:30:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:30:33,811 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 12:30:33,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:30:33,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 12:30:33,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:30:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 12:30:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:30:33,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:30:33,834 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:30:33,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:30:33,834 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:30:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:30:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1438800602, now seen corresponding path program 1 times [2022-04-15 12:30:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:30:33,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411694021] [2022-04-15 12:30:46,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:30:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash -781597209, now seen corresponding path program 1 times [2022-04-15 12:30:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:30:46,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214063976] [2022-04-15 12:30:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:30:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:30:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:30:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:30:46,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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(9, 2); {257#true} is VALID [2022-04-15 12:30:46,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:30:46,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #68#return; {257#true} is VALID [2022-04-15 12:30:46,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:30:46,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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(9, 2); {257#true} is VALID [2022-04-15 12:30:46,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:30:46,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #68#return; {257#true} is VALID [2022-04-15 12:30:46,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-15 12:30:46,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {257#true} is VALID [2022-04-15 12:30:46,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#true} assume !!(~n~0 <= 1000000);~k~0 := ~n~0;~i~0 := 0; {262#(<= main_~n~0 main_~k~0)} is VALID [2022-04-15 12:30:46,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#(<= main_~n~0 main_~k~0)} [72] L30-2-->L30-3_primed: Formula: (or (and (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2) (= v_main_~k~0_In_1 v_main_~k~0_Out_2)) (and (< v_main_~i~0_Out_2 (+ v_main_~n~0_In_1 2)) (<= v_main_~k~0_Out_2 v_main_~k~0_In_1) (= |v_main_#t~post2_Out_2| 0) (= v_main_~n~0_In_1 0) (= (+ v_main_~i~0_In_1 (* 2 v_main_~k~0_In_1)) (+ (* 2 v_main_~k~0_Out_2) v_main_~i~0_Out_2)))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~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_~k~0=v_main_~k~0_Out_2} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post2] {263#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-15 12:30:46,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} [71] L30-3_primed-->L30-3: Formula: (not (< v_main_~i~0_3 v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {263#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} is VALID [2022-04-15 12:30:46,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0))} ~j~0 := 0; {264#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2022-04-15 12:30:46,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {264#(and (= main_~j~0 0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~j~0 < (if ~n~0 < 0 && 0 != ~n~0 % 2 then 1 + ~n~0 / 2 else ~n~0 / 2)); {265#(<= 2 main_~k~0)} is VALID [2022-04-15 12:30:46,770 INFO L272 TraceCheckUtils]: 11: Hoare triple {265#(<= 2 main_~k~0)} call __VERIFIER_assert((if ~k~0 > 0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:30:46,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:30:46,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {258#false} is VALID [2022-04-15 12:30:46,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-15 12:30:46,771 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:30:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:30:46,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214063976] [2022-04-15 12:30:46,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214063976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:46,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:46,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:30:46,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:30:46,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411694021] [2022-04-15 12:30:46,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411694021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:30:46,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:30:46,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:30:46,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887991892] [2022-04-15 12:30:46,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:30:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 12:30:46,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:30:46,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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:30:46,891 WARN L143 InductivityCheck]: Transition 270#(and (exists ((v_main_~k~0_12 Int)) (and (or (= v_main_~k~0_12 (+ main_~k~0 1)) (and (<= (+ main_~k~0 1) v_main_~k~0_12) (= main_~n~0 0))) (<= main_~n~0 v_main_~k~0_12))) (< main_~i~0 (+ main_~n~0 2))) ( _ , assume !(~i~0 < ~n~0); , 263#(or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)) ) not inductive [2022-04-15 12:30:46,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:30:46,892 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:30:46,896 INFO L158 Benchmark]: Toolchain (without parser) took 14640.58ms. Allocated memory is still 197.1MB. Free memory was 150.5MB in the beginning and 124.8MB in the end (delta: 25.8MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2022-04-15 12:30:46,896 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:30:46,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.95ms. Allocated memory is still 197.1MB. Free memory was 150.3MB in the beginning and 177.1MB in the end (delta: -26.9MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-15 12:30:46,897 INFO L158 Benchmark]: Boogie Preprocessor took 35.66ms. Allocated memory is still 197.1MB. Free memory was 177.1MB in the beginning and 175.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:30:46,897 INFO L158 Benchmark]: RCFGBuilder took 270.39ms. Allocated memory is still 197.1MB. Free memory was 175.4MB in the beginning and 163.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:30:46,898 INFO L158 Benchmark]: TraceAbstraction took 14106.46ms. Allocated memory is still 197.1MB. Free memory was 163.1MB in the beginning and 124.8MB in the end (delta: 38.4MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2022-04-15 12:30:46,899 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.12ms. Allocated memory is still 197.1MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.95ms. Allocated memory is still 197.1MB. Free memory was 150.3MB in the beginning and 177.1MB in the end (delta: -26.9MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.66ms. Allocated memory is still 197.1MB. Free memory was 177.1MB in the beginning and 175.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.39ms. Allocated memory is still 197.1MB. Free memory was 175.4MB in the beginning and 163.8MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14106.46ms. Allocated memory is still 197.1MB. Free memory was 163.1MB in the beginning and 124.8MB in the end (delta: 38.4MB). Peak memory consumption was 39.2MB. 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:30:46,914 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...