/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:21:39,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:21:39,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:21:39,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:21:39,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:21:39,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:21:39,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:21:39,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:21:39,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:21:39,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:21:39,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:21:39,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:21:39,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:21:39,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:21:39,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:21:39,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:21:39,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:21:39,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:21:39,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:21:39,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:21:39,698 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:21:39,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:21:39,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:21:39,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:21:39,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:21:39,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:21:39,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:21:39,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:21:39,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:21:39,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:21:39,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:21:39,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:21:39,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:21:39,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:21:39,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:21:39,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:21:39,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:21:39,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:21:39,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:21:39,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:21:39,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:21:39,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:21:39,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:21:39,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:21:39,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:21:39,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:21:39,717 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:21:39,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:21:39,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:21:39,719 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:21:39,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:21:39,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:21:39,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:21:39,719 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:21:39,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:21:39,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:21:39,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:21:39,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:21:39,720 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:21:39,720 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:21:39,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:21:39,720 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:21:39,720 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-28 03:21:39,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:21:39,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:21:39,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:21:39,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:21:39,905 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:21:39,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2022-04-28 03:21:39,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9afaa557/5377822b0aa0491b98c484c9e7452ff6/FLAG4238930cc [2022-04-28 03:21:40,313 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:21:40,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-28 03:21:40,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9afaa557/5377822b0aa0491b98c484c9e7452ff6/FLAG4238930cc [2022-04-28 03:21:40,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9afaa557/5377822b0aa0491b98c484c9e7452ff6 [2022-04-28 03:21:40,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:21:40,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:21:40,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:21:40,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:21:40,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:21:40,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec2691c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40, skipping insertion in model container [2022-04-28 03:21:40,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:21:40,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:21:40,458 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-new/half.i[891,904] [2022-04-28 03:21:40,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:21:40,480 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:21:40,488 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-new/half.i[891,904] [2022-04-28 03:21:40,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:21:40,498 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:21:40,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40 WrapperNode [2022-04-28 03:21:40,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:21:40,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:21:40,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:21:40,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:21:40,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:21:40,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:21:40,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:21:40,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:21:40,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (1/1) ... [2022-04-28 03:21:40,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:21:40,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:40,546 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-28 03:21:40,547 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-28 03:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:21:40,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:21:40,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:21:40,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:21:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:21:40,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:21:40,614 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:21:40,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:21:40,712 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:21:40,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:21:40,733 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:21:40,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:21:40 BoogieIcfgContainer [2022-04-28 03:21:40,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:21:40,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:21:40,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:21:40,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:21:40,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:21:40" (1/3) ... [2022-04-28 03:21:40,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:21:40, skipping insertion in model container [2022-04-28 03:21:40,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:21:40" (2/3) ... [2022-04-28 03:21:40,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3166e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:21:40, skipping insertion in model container [2022-04-28 03:21:40,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:21:40" (3/3) ... [2022-04-28 03:21:40,749 INFO L111 eAbstractionObserver]: Analyzing ICFG half.i [2022-04-28 03:21:40,758 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:21:40,758 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:21:40,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:21:40,792 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b859c5e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b08d747 [2022-04-28 03:21:40,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:21:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-28 03:21:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:21:40,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:40,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:40,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 1 times [2022-04-28 03:21:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:40,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667394307] [2022-04-28 03:21:40,818 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:21:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 2 times [2022-04-28 03:21:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:40,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240332504] [2022-04-28 03:21:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:40,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:40,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:40,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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); {25#true} is VALID [2022-04-28 03:21:40,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:21:40,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-28 03:21:40,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:40,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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); {25#true} is VALID [2022-04-28 03:21:40,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:21:40,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-28 03:21:40,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2022-04-28 03:21:40,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-28 03:21:40,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {25#true} is VALID [2022-04-28 03:21:40,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 03:21:40,929 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {26#false} is VALID [2022-04-28 03:21:40,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 03:21:40,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 03:21:40,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 03:21:40,929 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-28 03:21:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:40,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240332504] [2022-04-28 03:21:40,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240332504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:40,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:40,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:21:40,933 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:40,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667394307] [2022-04-28 03:21:40,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667394307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:40,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:40,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:21:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117880376] [2022-04-28 03:21:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:40,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:40,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:40,955 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-28 03:21:40,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:21:40,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:21:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:21:40,972 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,040 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 03:21:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:21:41,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 03:21:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 03:21:41,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 03:21:41,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:41,113 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:21:41,114 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:21:41,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:21:41,121 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:41,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:21:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:21:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:21:41,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:41,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:41,152 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:41,153 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,156 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:21:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:21:41,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:41,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:41,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:21:41,157 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:21:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,160 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:21:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:21:41,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:41,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:41,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:41,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:21:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:21:41,164 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 03:21:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:41,166 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:21:41,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-28 03:21:41,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:21:41,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:21:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:21:41,190 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:41,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:41,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:21:41,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:41,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 1 times [2022-04-28 03:21:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:41,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247653213] [2022-04-28 03:21:41,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:21:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 2 times [2022-04-28 03:21:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:41,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96750695] [2022-04-28 03:21:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:41,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(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); {161#true} is VALID [2022-04-28 03:21:41,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 03:21:41,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-28 03:21:41,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:41,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(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); {161#true} is VALID [2022-04-28 03:21:41,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 03:21:41,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-28 03:21:41,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2022-04-28 03:21:41,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {166#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:21:41,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {167#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:21:41,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {168#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:21:41,361 INFO L272 TraceCheckUtils]: 8: Hoare triple {168#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {169#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:21:41,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {170#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:21:41,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-28 03:21:41,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 03:21:41,362 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-28 03:21:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96750695] [2022-04-28 03:21:41,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96750695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:41,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:41,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:21:41,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247653213] [2022-04-28 03:21:41,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247653213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:41,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:41,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:21:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906818888] [2022-04-28 03:21:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:41,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,375 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-28 03:21:41,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:21:41,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:41,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:21:41,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:21:41,376 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,577 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 03:21:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:21:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 03:21:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-28 03:21:41,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-28 03:21:41,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:41,611 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:21:41,611 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:21:41,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:21:41,614 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:41,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:21:41,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:21:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-28 03:21:41,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:41,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:21:41,624 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:21:41,625 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:21:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,626 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:21:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:21:41,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:41,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:41,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 21 states. [2022-04-28 03:21:41,627 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 21 states. [2022-04-28 03:21:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:41,630 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:21:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:21:41,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:41,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:41,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:41,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-28 03:21:41,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 03:21:41,632 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-28 03:21:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:41,632 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 03:21:41,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-28 03:21:41,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 03:21:41,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:21:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:21:41,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:41,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:41,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:21:41,653 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 1 times [2022-04-28 03:21:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:41,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660569431] [2022-04-28 03:21:42,087 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:42,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:42,137 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:21:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1503489941, now seen corresponding path program 1 times [2022-04-28 03:21:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:42,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643411002] [2022-04-28 03:21:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:42,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#(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); {316#true} is VALID [2022-04-28 03:21:42,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 03:21:42,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 03:21:42,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:42,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#(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); {316#true} is VALID [2022-04-28 03:21:42,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 03:21:42,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 03:21:42,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-28 03:21:42,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {321#(= main_~n~0 0)} is VALID [2022-04-28 03:21:42,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {322#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:42,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (= main_~n~0 0) (= main_~i~0 0))} [64] L29-3-->L29-4_primed: Formula: (let ((.cse1 (< v_main_~i~0_10 (* v_main_~k~0_8 2))) (.cse0 (= (mod v_main_~i~0_10 2) 0)) (.cse2 (= v_main_~n~0_7 v_main_~n~0_6)) (.cse3 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse4 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse5 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 (= (+ v_main_~i~0_10 v_main_~n~0_6) (+ v_main_~i~0_9 v_main_~n~0_7)) (< v_main_~n~0_7 v_main_~n~0_6) (< v_main_~n~0_6 (+ v_main_~n~0_7 2)) .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (= v_main_~k~0_8 v_main_~k~0_8)))) InVars {main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_7, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {323#(or (and (<= main_~n~0 main_~k~0) (<= (+ main_~i~0 1) (* main_~n~0 2))) (and (<= main_~i~0 (* main_~n~0 2)) (<= main_~n~0 0)))} is VALID [2022-04-28 03:21:42,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(or (and (<= main_~n~0 main_~k~0) (<= (+ main_~i~0 1) (* main_~n~0 2))) (and (<= main_~i~0 (* main_~n~0 2)) (<= main_~n~0 0)))} [65] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {323#(or (and (<= main_~n~0 main_~k~0) (<= (+ main_~i~0 1) (* main_~n~0 2))) (and (<= main_~i~0 (* main_~n~0 2)) (<= main_~n~0 0)))} is VALID [2022-04-28 03:21:42,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {323#(or (and (<= main_~n~0 main_~k~0) (<= (+ main_~i~0 1) (* main_~n~0 2))) (and (<= main_~i~0 (* main_~n~0 2)) (<= main_~n~0 0)))} [66] L29-3-->L29-4_primed: Formula: (and (= v_main_~n~0_7 v_main_~n~0_6) (= v_main_~i~0_10 v_main_~i~0_9) (= |v_main_#t~post2_7| |v_main_#t~post2_3|) (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) InVars {main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_7|, main_~n~0=v_main_~n~0_7, main_#t~post3=|v_main_#t~post3_7|} OutVars{main_~i~0=v_main_~i~0_9, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {324#(and (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 0)))} is VALID [2022-04-28 03:21:42,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#(and (or (<= main_~i~0 (* main_~n~0 2)) (<= main_~k~0 main_~n~0)) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 0)))} [63] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {325#(and (<= main_~k~0 main_~n~0) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 0)))} is VALID [2022-04-28 03:21:42,314 INFO L272 TraceCheckUtils]: 11: Hoare triple {325#(and (<= main_~k~0 main_~n~0) (or (not (<= (+ main_~k~0 1) main_~n~0)) (<= main_~n~0 0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {326#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:21:42,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {327#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:21:42,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {317#false} is VALID [2022-04-28 03:21:42,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-28 03:21:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:42,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643411002] [2022-04-28 03:21:42,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643411002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:42,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372653075] [2022-04-28 03:21:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:42,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:42,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:42,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:21:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:21:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:42,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:21:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:42,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:42,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-28 03:21:42,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} #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); {316#true} is VALID [2022-04-28 03:21:42,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 03:21:42,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 03:21:42,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-28 03:21:42,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {321#(= main_~n~0 0)} is VALID [2022-04-28 03:21:42,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {322#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:42,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (= main_~n~0 0) (= main_~i~0 0))} [64] L29-3-->L29-4_primed: Formula: (let ((.cse1 (< v_main_~i~0_10 (* v_main_~k~0_8 2))) (.cse0 (= (mod v_main_~i~0_10 2) 0)) (.cse2 (= v_main_~n~0_7 v_main_~n~0_6)) (.cse3 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse4 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse5 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 (= (+ v_main_~i~0_10 v_main_~n~0_6) (+ v_main_~i~0_9 v_main_~n~0_7)) (< v_main_~n~0_7 v_main_~n~0_6) (< v_main_~n~0_6 (+ v_main_~n~0_7 2)) .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (= v_main_~k~0_8 v_main_~k~0_8)))) InVars {main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_7, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {353#(or (and (< 0 main_~n~0) (= main_~i~0 main_~n~0) (< 0 (* main_~k~0 2)) (< main_~n~0 2)) (and (= main_~n~0 0) (= main_~i~0 0)))} is VALID [2022-04-28 03:21:42,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(or (and (< 0 main_~n~0) (= main_~i~0 main_~n~0) (< 0 (* main_~k~0 2)) (< main_~n~0 2)) (and (= main_~n~0 0) (= main_~i~0 0)))} [65] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#(or (and (< 0 main_~n~0) (= main_~i~0 main_~n~0) (< 0 (* main_~k~0 2)) (< main_~n~0 2)) (and (= main_~n~0 0) (= main_~i~0 0)))} is VALID [2022-04-28 03:21:42,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#(or (and (< 0 main_~n~0) (= main_~i~0 main_~n~0) (< 0 (* main_~k~0 2)) (< main_~n~0 2)) (and (= main_~n~0 0) (= main_~i~0 0)))} [66] L29-3-->L29-4_primed: Formula: (and (= v_main_~n~0_7 v_main_~n~0_6) (= v_main_~i~0_10 v_main_~i~0_9) (= |v_main_#t~post2_7| |v_main_#t~post2_3|) (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) InVars {main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_7|, main_~n~0=v_main_~n~0_7, main_#t~post3=|v_main_#t~post3_7|} OutVars{main_~i~0=v_main_~i~0_9, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {360#(or (and (= main_~n~0 0) (<= main_~i~0 0)) (and (< 0 main_~n~0) (<= main_~i~0 main_~n~0) (< 0 (* main_~k~0 2)) (< main_~n~0 2)))} is VALID [2022-04-28 03:21:42,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {360#(or (and (= main_~n~0 0) (<= main_~i~0 0)) (and (< 0 main_~n~0) (<= main_~i~0 main_~n~0) (< 0 (* main_~k~0 2)) (< main_~n~0 2)))} [63] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {364#(and (= main_~n~0 0) (<= (* main_~k~0 2) 0))} is VALID [2022-04-28 03:21:42,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {364#(and (= main_~n~0 0) (<= (* main_~k~0 2) 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:21:42,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:42,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {317#false} is VALID [2022-04-28 03:21:42,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-28 03:21:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:21:42,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:43,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-28 03:21:43,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {317#false} is VALID [2022-04-28 03:21:43,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:43,163 INFO L272 TraceCheckUtils]: 11: Hoare triple {388#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:21:43,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [63] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {388#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-28 03:21:43,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [66] L29-3-->L29-4_primed: Formula: (and (= v_main_~n~0_7 v_main_~n~0_6) (= v_main_~i~0_10 v_main_~i~0_9) (= |v_main_#t~post2_7| |v_main_#t~post2_3|) (= |v_main_#t~post3_7| |v_main_#t~post3_3|)) InVars {main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_7|, main_~n~0=v_main_~n~0_7, main_#t~post3=|v_main_#t~post3_7|} OutVars{main_~i~0=v_main_~i~0_9, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {392#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:43,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [65] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:43,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(and (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) (+ main_~n~0 1))) (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= main_~n~0 0)))} [64] L29-3-->L29-4_primed: Formula: (let ((.cse1 (< v_main_~i~0_10 (* v_main_~k~0_8 2))) (.cse0 (= (mod v_main_~i~0_10 2) 0)) (.cse2 (= v_main_~n~0_7 v_main_~n~0_6)) (.cse3 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse4 (= |v_main_#t~post3_4| |v_main_#t~post3_3|)) (.cse5 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and .cse0 (= (+ v_main_~i~0_10 v_main_~n~0_6) (+ v_main_~i~0_9 v_main_~n~0_7)) (< v_main_~n~0_7 v_main_~n~0_6) (< v_main_~n~0_6 (+ v_main_~n~0_7 2)) .cse1) (and .cse2 .cse3 (or (not .cse1) (not .cse0)) .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (= v_main_~k~0_8 v_main_~k~0_8)))) InVars {main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_7, main_#t~post3=|v_main_#t~post3_4|, main_~k~0=v_main_~k~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_#t~post2=|v_main_#t~post2_3|, main_#t~post3=|v_main_#t~post3_3|, main_~n~0=v_main_~n~0_6, main_~k~0=v_main_~k~0_8} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {392#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:43,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {402#(and (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) (+ main_~n~0 1))) (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= main_~n~0 0)))} is VALID [2022-04-28 03:21:43,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {321#(= main_~n~0 0)} is VALID [2022-04-28 03:21:43,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-28 03:21:43,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-28 03:21:43,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-28 03:21:43,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} #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); {316#true} is VALID [2022-04-28 03:21:43,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-28 03:21:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:21:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372653075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:43,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:21:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 18 [2022-04-28 03:21:43,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:43,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660569431] [2022-04-28 03:21:43,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660569431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:43,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:43,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:21:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492479292] [2022-04-28 03:21:43,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:43,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,312 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-28 03:21:43,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:21:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:21:43,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:21:43,313 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:43,532 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-28 03:21:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:21:43,532 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:21:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 03:21:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 03:21:43,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 03:21:43,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:43,564 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:21:43,564 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:21:43,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:21:43,565 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:21:43,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:21:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:21:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 03:21:43,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:21:43,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-28 03:21:43,571 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-28 03:21:43,571 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-28 03:21:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:43,572 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-28 03:21:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 03:21:43,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:43,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:43,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 21 states. [2022-04-28 03:21:43,573 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 21 states. [2022-04-28 03:21:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:21:43,574 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-28 03:21:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 03:21:43,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:21:43,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:21:43,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:21:43,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:21:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-28 03:21:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-28 03:21:43,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2022-04-28 03:21:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:21:43,575 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-28 03:21:43,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 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-28 03:21:43,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-28 03:21:43,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:21:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-28 03:21:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:21:43,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:21:43,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:21:43,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:21:43,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:43,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:21:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:21:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 1 times [2022-04-28 03:21:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:21:43,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146200300] [2022-04-28 03:21:44,115 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:44,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:44,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:44,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:44,981 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 03:21:44,982 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:21:44,985 INFO L85 PathProgramCache]: Analyzing trace with hash 680619922, now seen corresponding path program 1 times [2022-04-28 03:21:44,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:21:44,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645249340] [2022-04-28 03:21:44,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:44,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:21:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:45,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:21:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:45,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {595#(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); {583#true} is VALID [2022-04-28 03:21:45,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-28 03:21:45,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-28 03:21:45,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {595#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:21:45,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {595#(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); {583#true} is VALID [2022-04-28 03:21:45,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-28 03:21:45,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-28 03:21:45,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2022-04-28 03:21:45,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {583#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {588#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-28 03:21:45,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [68] L29-3-->L29-4_primed: Formula: (let ((.cse3 (= |v_main_#t~post2_17| |v_main_#t~post2_15|)) (.cse4 (= v_main_~i~0_27 v_main_~i~0_26)) (.cse2 (= (mod v_main_~i~0_27 2) 0)) (.cse1 (<= 0 v_main_~i~0_27)) (.cse0 (< v_main_~i~0_27 (* v_main_~k~0_12 2)))) (or (and (or (not .cse0) (not .cse1) .cse2) .cse3 .cse4) (and .cse3 (= v_main_~k~0_12 v_main_~k~0_12) .cse4) (and (not .cse2) .cse1 (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse0))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_17|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [69] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [70] L29-3-->L29-4_primed: Formula: (let ((.cse1 (= (mod v_main_~i~0_27 2) 0)) (.cse0 (< v_main_~i~0_27 (* v_main_~k~0_12 2))) (.cse2 (= v_main_~i~0_27 v_main_~i~0_26))) (or (and (= |v_main_#t~post2_15| |v_main_#t~post2_20|) (or (not .cse0) .cse1) .cse2) (and (not .cse1) (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse0) (and (= |v_main_#t~post2_20| |v_main_#t~post2_15|) (= v_main_~k~0_12 v_main_~k~0_12) .cse2))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_20|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [71] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [72] L29-3-->L29-4_primed: Formula: (let ((.cse3 (< v_main_~i~0_27 (* v_main_~k~0_12 2))) (.cse2 (< v_main_~i~0_27 0)) (.cse1 (= (mod v_main_~i~0_27 2) 0)) (.cse0 (= v_main_~i~0_27 v_main_~i~0_26))) (or (and (= |v_main_#t~post2_23| |v_main_#t~post2_15|) (= v_main_~k~0_12 v_main_~k~0_12) .cse0) (and (not .cse1) .cse2 (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse3) (and (or (not .cse3) (not .cse2) .cse1) (= |v_main_#t~post2_15| |v_main_#t~post2_23|) .cse0))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_23|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [73] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {589#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [74] L29-3-->L29-4_primed: Formula: (let ((.cse2 (< v_main_~i~0_29 (* v_main_~k~0_13 2))) (.cse1 (= (mod v_main_~i~0_29 2) 0)) (.cse0 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse3 (= v_main_~n~0_23 v_main_~n~0_22)) (.cse4 (= |v_main_#t~post3_16| |v_main_#t~post3_15|))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4 (= |v_main_#t~post2_16| |v_main_#t~post2_26|)) (and (< v_main_~i~0_29 v_main_~i~0_28) (< v_main_~i~0_28 (+ v_main_~i~0_29 2)) .cse2 .cse1 (= (+ v_main_~i~0_28 v_main_~n~0_23) (+ v_main_~i~0_29 v_main_~n~0_22))) (and .cse0 .cse3 (= v_main_~k~0_13 v_main_~k~0_13) .cse4 (= |v_main_#t~post2_26| |v_main_#t~post2_16|)))) InVars {main_~i~0=v_main_~i~0_29, main_#t~post2=|v_main_#t~post2_26|, main_~n~0=v_main_~n~0_23, main_#t~post3=|v_main_#t~post3_16|, main_~k~0=v_main_~k~0_13} OutVars{main_~i~0=v_main_~i~0_28, main_#t~post2=|v_main_#t~post2_16|, main_#t~post3=|v_main_#t~post3_15|, main_~n~0=v_main_~n~0_22, main_~k~0=v_main_~k~0_13} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {590#(and (or (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0) (not (= main_~i~0 0))))} is VALID [2022-04-28 03:21:45,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {590#(and (or (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0) (not (= main_~i~0 0))))} [75] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {590#(and (or (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0) (not (= main_~i~0 0))))} is VALID [2022-04-28 03:21:45,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {590#(and (or (<= (+ main_~i~0 1) (* main_~k~0 2)) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0) (not (= main_~i~0 0))))} [76] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse1 (= v_main_~n~0_23 v_main_~n~0_22)) (.cse2 (= |v_main_#t~post3_19| |v_main_#t~post3_15|))) (or (and .cse0 (= |v_main_#t~post2_16| |v_main_#t~post2_29|) .cse1 .cse2) (and .cse0 (= |v_main_#t~post2_29| |v_main_#t~post2_16|) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_29, main_#t~post2=|v_main_#t~post2_29|, main_~n~0=v_main_~n~0_23, main_#t~post3=|v_main_#t~post3_19|} OutVars{main_~i~0=v_main_~i~0_28, main_#t~post2=|v_main_#t~post2_16|, main_#t~post3=|v_main_#t~post3_15|, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {591#(or (and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))) (<= (+ main_~i~0 1) (* main_~k~0 2)))} is VALID [2022-04-28 03:21:45,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {591#(or (and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))) (<= (+ main_~i~0 1) (* main_~k~0 2)))} [67] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {592#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-28 03:21:45,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {592#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {593#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:21:45,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {593#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {594#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:21:45,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {584#false} is VALID [2022-04-28 03:21:45,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-04-28 03:21:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:21:45,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:21:45,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645249340] [2022-04-28 03:21:45,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645249340] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:21:45,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038399818] [2022-04-28 03:21:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:21:45,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:21:45,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:21:45,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:21:45,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:21:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:45,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 03:21:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:21:45,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:21:45,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2022-04-28 03:21:45,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#true} #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); {583#true} is VALID [2022-04-28 03:21:45,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-28 03:21:45,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-28 03:21:45,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2022-04-28 03:21:45,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {583#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {614#(= main_~n~0 0)} is VALID [2022-04-28 03:21:45,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [68] L29-3-->L29-4_primed: Formula: (let ((.cse3 (= |v_main_#t~post2_17| |v_main_#t~post2_15|)) (.cse4 (= v_main_~i~0_27 v_main_~i~0_26)) (.cse2 (= (mod v_main_~i~0_27 2) 0)) (.cse1 (<= 0 v_main_~i~0_27)) (.cse0 (< v_main_~i~0_27 (* v_main_~k~0_12 2)))) (or (and (or (not .cse0) (not .cse1) .cse2) .cse3 .cse4) (and .cse3 (= v_main_~k~0_12 v_main_~k~0_12) .cse4) (and (not .cse2) .cse1 (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse0))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_17|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [69] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [70] L29-3-->L29-4_primed: Formula: (let ((.cse1 (= (mod v_main_~i~0_27 2) 0)) (.cse0 (< v_main_~i~0_27 (* v_main_~k~0_12 2))) (.cse2 (= v_main_~i~0_27 v_main_~i~0_26))) (or (and (= |v_main_#t~post2_15| |v_main_#t~post2_20|) (or (not .cse0) .cse1) .cse2) (and (not .cse1) (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse0) (and (= |v_main_#t~post2_20| |v_main_#t~post2_15|) (= v_main_~k~0_12 v_main_~k~0_12) .cse2))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_20|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [71] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [72] L29-3-->L29-4_primed: Formula: (let ((.cse3 (< v_main_~i~0_27 (* v_main_~k~0_12 2))) (.cse2 (< v_main_~i~0_27 0)) (.cse1 (= (mod v_main_~i~0_27 2) 0)) (.cse0 (= v_main_~i~0_27 v_main_~i~0_26))) (or (and (= |v_main_#t~post2_23| |v_main_#t~post2_15|) (= v_main_~k~0_12 v_main_~k~0_12) .cse0) (and (not .cse1) .cse2 (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse3) (and (or (not .cse3) (not .cse2) .cse1) (= |v_main_#t~post2_15| |v_main_#t~post2_23|) .cse0))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_23|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [73] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#(and (= main_~n~0 0) (= main_~i~0 0))} is VALID [2022-04-28 03:21:45,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#(and (= main_~n~0 0) (= main_~i~0 0))} [74] L29-3-->L29-4_primed: Formula: (let ((.cse2 (< v_main_~i~0_29 (* v_main_~k~0_13 2))) (.cse1 (= (mod v_main_~i~0_29 2) 0)) (.cse0 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse3 (= v_main_~n~0_23 v_main_~n~0_22)) (.cse4 (= |v_main_#t~post3_16| |v_main_#t~post3_15|))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4 (= |v_main_#t~post2_16| |v_main_#t~post2_26|)) (and (< v_main_~i~0_29 v_main_~i~0_28) (< v_main_~i~0_28 (+ v_main_~i~0_29 2)) .cse2 .cse1 (= (+ v_main_~i~0_28 v_main_~n~0_23) (+ v_main_~i~0_29 v_main_~n~0_22))) (and .cse0 .cse3 (= v_main_~k~0_13 v_main_~k~0_13) .cse4 (= |v_main_#t~post2_26| |v_main_#t~post2_16|)))) InVars {main_~i~0=v_main_~i~0_29, main_#t~post2=|v_main_#t~post2_26|, main_~n~0=v_main_~n~0_23, main_#t~post3=|v_main_#t~post3_16|, main_~k~0=v_main_~k~0_13} OutVars{main_~i~0=v_main_~i~0_28, main_#t~post2=|v_main_#t~post2_16|, main_#t~post3=|v_main_#t~post3_15|, main_~n~0=v_main_~n~0_22, main_~k~0=v_main_~k~0_13} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {640#(or (and (= main_~n~0 0) (= main_~i~0 0)) (and (< 0 main_~i~0) (= main_~i~0 main_~n~0) (< main_~i~0 2) (< 0 (* main_~k~0 2))))} is VALID [2022-04-28 03:21:45,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(or (and (= main_~n~0 0) (= main_~i~0 0)) (and (< 0 main_~i~0) (= main_~i~0 main_~n~0) (< main_~i~0 2) (< 0 (* main_~k~0 2))))} [75] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {640#(or (and (= main_~n~0 0) (= main_~i~0 0)) (and (< 0 main_~i~0) (= main_~i~0 main_~n~0) (< main_~i~0 2) (< 0 (* main_~k~0 2))))} is VALID [2022-04-28 03:21:45,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(or (and (= main_~n~0 0) (= main_~i~0 0)) (and (< 0 main_~i~0) (= main_~i~0 main_~n~0) (< main_~i~0 2) (< 0 (* main_~k~0 2))))} [76] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse1 (= v_main_~n~0_23 v_main_~n~0_22)) (.cse2 (= |v_main_#t~post3_19| |v_main_#t~post3_15|))) (or (and .cse0 (= |v_main_#t~post2_16| |v_main_#t~post2_29|) .cse1 .cse2) (and .cse0 (= |v_main_#t~post2_29| |v_main_#t~post2_16|) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_29, main_#t~post2=|v_main_#t~post2_29|, main_~n~0=v_main_~n~0_23, main_#t~post3=|v_main_#t~post3_19|} OutVars{main_~i~0=v_main_~i~0_28, main_#t~post2=|v_main_#t~post2_16|, main_#t~post3=|v_main_#t~post3_15|, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {640#(or (and (= main_~n~0 0) (= main_~i~0 0)) (and (< 0 main_~i~0) (= main_~i~0 main_~n~0) (< main_~i~0 2) (< 0 (* main_~k~0 2))))} is VALID [2022-04-28 03:21:45,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {640#(or (and (= main_~n~0 0) (= main_~i~0 0)) (and (< 0 main_~i~0) (= main_~i~0 main_~n~0) (< main_~i~0 2) (< 0 (* main_~k~0 2))))} [67] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {650#(and (not (< 0 (* main_~k~0 2))) (= main_~n~0 0))} is VALID [2022-04-28 03:21:45,659 INFO L272 TraceCheckUtils]: 17: Hoare triple {650#(and (not (< 0 (* main_~k~0 2))) (= main_~n~0 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:21:45,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:45,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {584#false} is VALID [2022-04-28 03:21:45,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-04-28 03:21:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:21:45,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:21:46,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-04-28 03:21:46,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {584#false} is VALID [2022-04-28 03:21:46,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:21:46,818 INFO L272 TraceCheckUtils]: 17: Hoare triple {674#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:21:46,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [67] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {674#(or (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [76] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse1 (= v_main_~n~0_23 v_main_~n~0_22)) (.cse2 (= |v_main_#t~post3_19| |v_main_#t~post3_15|))) (or (and .cse0 (= |v_main_#t~post2_16| |v_main_#t~post2_29|) .cse1 .cse2) (and .cse0 (= |v_main_#t~post2_29| |v_main_#t~post2_16|) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_29, main_#t~post2=|v_main_#t~post2_29|, main_~n~0=v_main_~n~0_23, main_#t~post3=|v_main_#t~post3_19|} OutVars{main_~i~0=v_main_~i~0_28, main_#t~post2=|v_main_#t~post2_16|, main_#t~post3=|v_main_#t~post3_15|, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [75] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [74] L29-3-->L29-4_primed: Formula: (let ((.cse2 (< v_main_~i~0_29 (* v_main_~k~0_13 2))) (.cse1 (= (mod v_main_~i~0_29 2) 0)) (.cse0 (= v_main_~i~0_29 v_main_~i~0_28)) (.cse3 (= v_main_~n~0_23 v_main_~n~0_22)) (.cse4 (= |v_main_#t~post3_16| |v_main_#t~post3_15|))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3 .cse4 (= |v_main_#t~post2_16| |v_main_#t~post2_26|)) (and (< v_main_~i~0_29 v_main_~i~0_28) (< v_main_~i~0_28 (+ v_main_~i~0_29 2)) .cse2 .cse1 (= (+ v_main_~i~0_28 v_main_~n~0_23) (+ v_main_~i~0_29 v_main_~n~0_22))) (and .cse0 .cse3 (= v_main_~k~0_13 v_main_~k~0_13) .cse4 (= |v_main_#t~post2_26| |v_main_#t~post2_16|)))) InVars {main_~i~0=v_main_~i~0_29, main_#t~post2=|v_main_#t~post2_26|, main_~n~0=v_main_~n~0_23, main_#t~post3=|v_main_#t~post3_16|, main_~k~0=v_main_~k~0_13} OutVars{main_~i~0=v_main_~i~0_28, main_#t~post2=|v_main_#t~post2_16|, main_#t~post3=|v_main_#t~post3_15|, main_~n~0=v_main_~n~0_22, main_~k~0=v_main_~k~0_13} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} [73] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(or (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0) (<= 0 main_~i~0)) (< main_~i~0 (* main_~k~0 2))) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [72] L29-3-->L29-4_primed: Formula: (let ((.cse3 (< v_main_~i~0_27 (* v_main_~k~0_12 2))) (.cse2 (< v_main_~i~0_27 0)) (.cse1 (= (mod v_main_~i~0_27 2) 0)) (.cse0 (= v_main_~i~0_27 v_main_~i~0_26))) (or (and (= |v_main_#t~post2_23| |v_main_#t~post2_15|) (= v_main_~k~0_12 v_main_~k~0_12) .cse0) (and (not .cse1) .cse2 (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse3) (and (or (not .cse3) (not .cse2) .cse1) (= |v_main_#t~post2_15| |v_main_#t~post2_23|) .cse0))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_23|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {678#(or (= main_~n~0 main_~k~0) (< main_~i~0 (* main_~k~0 2)) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(or (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0) (<= 0 main_~i~0)) (< main_~i~0 (* main_~k~0 2))) (= main_~n~0 main_~k~0) (< main_~k~0 0))} [71] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {694#(or (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0) (<= 0 main_~i~0)) (< main_~i~0 (* main_~k~0 2))) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {701#(or (= main_~n~0 main_~k~0) (< main_~k~0 0) (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0)) (< main_~i~0 (* main_~k~0 2))))} [70] L29-3-->L29-4_primed: Formula: (let ((.cse1 (= (mod v_main_~i~0_27 2) 0)) (.cse0 (< v_main_~i~0_27 (* v_main_~k~0_12 2))) (.cse2 (= v_main_~i~0_27 v_main_~i~0_26))) (or (and (= |v_main_#t~post2_15| |v_main_#t~post2_20|) (or (not .cse0) .cse1) .cse2) (and (not .cse1) (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse0) (and (= |v_main_#t~post2_20| |v_main_#t~post2_15|) (= v_main_~k~0_12 v_main_~k~0_12) .cse2))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_20|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {694#(or (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0) (<= 0 main_~i~0)) (< main_~i~0 (* main_~k~0 2))) (= main_~n~0 main_~k~0) (< main_~k~0 0))} is VALID [2022-04-28 03:21:46,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {701#(or (= main_~n~0 main_~k~0) (< main_~k~0 0) (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0)) (< main_~i~0 (* main_~k~0 2))))} [69] L29-4_primed-->L29-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {701#(or (= main_~n~0 main_~k~0) (< main_~k~0 0) (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0)) (< main_~i~0 (* main_~k~0 2))))} is VALID [2022-04-28 03:21:46,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {708#(and (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) (+ main_~n~0 1))) (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= main_~n~0 0)) (or (= 0 (mod main_~i~0 2)) (and (or (<= (+ (div main_~i~0 2) 2) 0) (<= (+ (div main_~i~0 2) 1) main_~n~0)) (or (<= (+ (div main_~i~0 2) 2) 0) (<= main_~n~0 0)))))} [68] L29-3-->L29-4_primed: Formula: (let ((.cse3 (= |v_main_#t~post2_17| |v_main_#t~post2_15|)) (.cse4 (= v_main_~i~0_27 v_main_~i~0_26)) (.cse2 (= (mod v_main_~i~0_27 2) 0)) (.cse1 (<= 0 v_main_~i~0_27)) (.cse0 (< v_main_~i~0_27 (* v_main_~k~0_12 2)))) (or (and (or (not .cse0) (not .cse1) .cse2) .cse3 .cse4) (and .cse3 (= v_main_~k~0_12 v_main_~k~0_12) .cse4) (and (not .cse2) .cse1 (< v_main_~i~0_27 v_main_~i~0_26) (< (div (* v_main_~i~0_26 (- 1)) (- 2)) (+ 2 (div v_main_~i~0_27 2))) .cse0))) InVars {main_~i~0=v_main_~i~0_27, main_#t~post2=|v_main_#t~post2_17|, main_~k~0=v_main_~k~0_12} OutVars{main_~i~0=v_main_~i~0_26, main_#t~post2=|v_main_#t~post2_15|, main_~k~0=v_main_~k~0_12} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {701#(or (= main_~n~0 main_~k~0) (< main_~k~0 0) (and (or (= 0 (mod main_~i~0 2)) (<= (+ (div main_~i~0 2) 2) main_~k~0)) (< main_~i~0 (* main_~k~0 2))))} is VALID [2022-04-28 03:21:46,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(= main_~n~0 0)} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {708#(and (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) (+ main_~n~0 1))) (or (< (div (+ (- 1) (* (- 1) main_~i~0)) (- 2)) 1) (<= main_~n~0 0)) (or (= 0 (mod main_~i~0 2)) (and (or (<= (+ (div main_~i~0 2) 2) 0) (<= (+ (div main_~i~0 2) 1) main_~n~0)) (or (<= (+ (div main_~i~0 2) 2) 0) (<= main_~n~0 0)))))} is VALID [2022-04-28 03:21:46,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {583#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {614#(= main_~n~0 0)} is VALID [2022-04-28 03:21:46,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2022-04-28 03:21:46,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-28 03:21:46,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-28 03:21:46,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#true} #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); {583#true} is VALID [2022-04-28 03:21:46,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2022-04-28 03:21:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:21:46,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038399818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:21:46,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:21:46,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 21 [2022-04-28 03:21:46,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:21:46,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146200300] [2022-04-28 03:21:46,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146200300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:21:46,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:21:46,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:21:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569111022] [2022-04-28 03:21:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:21:46,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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 18 [2022-04-28 03:21:46,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:21:46,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 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-28 03:21:46,977 WARN L143 InductivityCheck]: Transition 732#(and (= main_~i~0 2) (< 0 (* main_~k~0 2))) ( _ , assume !(~i~0 < 2 * ~k~0); , 592#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))) ) not inductive [2022-04-28 03:21:46,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:21:47,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 03:21:47,178 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:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 03:21:47,180 INFO L158 Benchmark]: Toolchain (without parser) took 6853.60ms. Allocated memory was 188.7MB in the beginning and 309.3MB in the end (delta: 120.6MB). Free memory was 140.0MB in the beginning and 190.3MB in the end (delta: -50.3MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2022-04-28 03:21:47,181 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:21:47,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.89ms. Allocated memory is still 188.7MB. Free memory was 139.8MB in the beginning and 166.1MB in the end (delta: -26.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 03:21:47,181 INFO L158 Benchmark]: Boogie Preprocessor took 22.91ms. Allocated memory is still 188.7MB. Free memory was 166.1MB in the beginning and 164.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:21:47,181 INFO L158 Benchmark]: RCFGBuilder took 210.89ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 153.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 03:21:47,181 INFO L158 Benchmark]: TraceAbstraction took 6444.47ms. Allocated memory was 188.7MB in the beginning and 309.3MB in the end (delta: 120.6MB). Free memory was 152.5MB in the beginning and 190.3MB in the end (delta: -37.8MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. [2022-04-28 03:21:47,182 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.11ms. Allocated memory is still 188.7MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.89ms. Allocated memory is still 188.7MB. Free memory was 139.8MB in the beginning and 166.1MB in the end (delta: -26.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.91ms. Allocated memory is still 188.7MB. Free memory was 166.1MB in the beginning and 164.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 210.89ms. Allocated memory is still 188.7MB. Free memory was 164.6MB in the beginning and 153.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6444.47ms. Allocated memory was 188.7MB in the beginning and 309.3MB in the end (delta: 120.6MB). Free memory was 152.5MB in the beginning and 190.3MB in the end (delta: -37.8MB). Peak memory consumption was 84.4MB. 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-28 03:21:47,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...