/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-e106359-m [2022-04-15 06:21:48,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:21:48,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:21:48,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:21:48,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:21:48,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:21:48,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:21:48,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:21:48,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:21:48,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:21:48,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:21:48,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:21:48,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:21:48,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:21:48,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:21:48,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:21:48,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:21:48,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:21:48,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:21:48,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:21:48,861 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:21:48,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:21:48,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:21:48,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:21:48,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:21:48,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:21:48,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:21:48,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:21:48,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:21:48,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:21:48,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:21:48,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:21:48,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:21:48,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:21:48,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:21:48,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:21:48,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:21:48,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:21:48,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:21:48,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:21:48,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:21:48,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:21:48,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:21:48,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:21:48,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:21:48,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:21:48,893 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:21:48,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:21:48,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:21:48,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:21:48,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:21:48,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:21:48,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:21:48,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:21:48,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:21:48,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:21:48,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:21:48,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:21:48,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:21:48,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:21:48,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:21:48,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:21:48,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:21:48,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:21:48,896 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:21:48,896 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:21:48,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:21:48,897 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:21:48,897 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:21:49,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:21:49,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:21:49,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:21:49,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:21:49,127 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:21:49,128 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-15 06:21:49,193 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4ce0cdd/6aad208d065845429c668561e8501151/FLAG487c0997b [2022-04-15 06:21:49,554 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:21:49,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-15 06:21:49,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4ce0cdd/6aad208d065845429c668561e8501151/FLAG487c0997b [2022-04-15 06:21:49,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4ce0cdd/6aad208d065845429c668561e8501151 [2022-04-15 06:21:49,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:21:49,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:21:49,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:21:49,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:21:49,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:21:49,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa697c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49, skipping insertion in model container [2022-04-15 06:21:49,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:21:49,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:21:49,771 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-15 06:21:49,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:21:49,789 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:21:49,799 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-15 06:21:49,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:21:49,815 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:21:49,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49 WrapperNode [2022-04-15 06:21:49,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:21:49,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:21:49,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:21:49,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:21:49,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:21:49,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:21:49,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:21:49,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:21:49,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (1/1) ... [2022-04-15 06:21:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:21:49,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:49,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:21:49,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:21:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:21:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:21:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:21:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 06:21:49,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:21:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:21:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:21:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:21:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 06:21:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 06:21:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:21:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:21:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 06:21:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:21:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 06:21:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:21:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:21:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:21:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:21:49,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:21:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:21:49,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:21:49,964 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:21:49,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:21:50,093 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:21:50,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:21:50,099 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:21:50,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:21:50 BoogieIcfgContainer [2022-04-15 06:21:50,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:21:50,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:21:50,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:21:50,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:21:50,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:21:49" (1/3) ... [2022-04-15 06:21:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea2e9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:21:50, skipping insertion in model container [2022-04-15 06:21:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:21:49" (2/3) ... [2022-04-15 06:21:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea2e9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:21:50, skipping insertion in model container [2022-04-15 06:21:50,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:21:50" (3/3) ... [2022-04-15 06:21:50,108 INFO L111 eAbstractionObserver]: Analyzing ICFG half.i [2022-04-15 06:21:50,112 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:21:50,112 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:21:50,148 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:21:50,153 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:21:50,153 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:21:50,192 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-15 06:21:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:21:50,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:50,198 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:50,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 1 times [2022-04-15 06:21:50,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:50,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599014221] [2022-04-15 06:21:50,236 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:21:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 2 times [2022-04-15 06:21:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:50,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267260960] [2022-04-15 06:21:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:50,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:21:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:50,460 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-15 06:21:50,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:21:50,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-15 06:21:50,462 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-15 06:21:50,463 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-15 06:21:50,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:21:50,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-15 06:21:50,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2022-04-15 06:21:50,464 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-15 06:21:50,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {25#true} is VALID [2022-04-15 06:21:50,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 06:21:50,466 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-15 06:21:50,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 06:21:50,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:21:50,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:21:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:21:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267260960] [2022-04-15 06:21:50,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267260960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:50,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:50,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:21:50,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599014221] [2022-04-15 06:21:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599014221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:50,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:50,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:21:50,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550123271] [2022-04-15 06:21:50,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:50,478 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-15 06:21:50,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:50,482 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-15 06:21:50,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:50,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:21:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:50,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:21:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:21:50,535 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-15 06:21:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:50,629 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:21:50,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:21:50,630 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-15 06:21:50,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:50,631 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-15 06:21:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 06:21:50,641 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-15 06:21:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 06:21:50,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-15 06:21:50,697 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-15 06:21:50,704 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:21:50,705 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:21:50,707 INFO L912 BasicCegarLoop]: 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-15 06:21:50,710 INFO L913 BasicCegarLoop]: 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-15 06:21:50,711 INFO L914 BasicCegarLoop]: 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-15 06:21:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:21:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:21:50,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:50,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:50,734 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:50,734 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:50,741 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:21:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:21:50,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:50,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:50,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:21:50,742 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:21:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:50,745 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:21:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:21:50,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:50,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:50,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:50,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:21:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 06:21:50,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 06:21:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:50,750 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 06:21:50,751 INFO L479 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-15 06:21:50,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 06:21:50,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:21:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:21:50,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:50,772 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:50,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:21:50,772 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 1 times [2022-04-15 06:21:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:50,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [728748664] [2022-04-15 06:21:50,776 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:21:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 2 times [2022-04-15 06:21:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:50,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484786864] [2022-04-15 06:21:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:50,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:21:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:50,939 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-15 06:21:50,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 06:21:50,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-15 06:21:50,950 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-15 06:21:50,950 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-15 06:21:50,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 06:21:50,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-15 06:21:50,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2022-04-15 06:21:50,952 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-15 06:21:50,953 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-15 06:21:50,954 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-15 06:21:50,955 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-15 06:21:50,955 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-15 06:21:50,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-15 06:21:50,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-15 06:21:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:21:50,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484786864] [2022-04-15 06:21:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484786864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:50,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:50,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:21:50,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:50,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [728748664] [2022-04-15 06:21:50,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [728748664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:50,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:50,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:21:50,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067200692] [2022-04-15 06:21:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:50,964 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-15 06:21:50,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:50,965 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-15 06:21:50,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:50,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:21:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:21:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:21:50,978 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-15 06:21:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:51,217 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:21:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:21:51,217 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-15 06:21:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:51,217 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-15 06:21:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 06:21:51,221 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-15 06:21:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 06:21:51,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-15 06:21:51,260 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-15 06:21:51,262 INFO L225 Difference]: With dead ends: 27 [2022-04-15 06:21:51,263 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:21:51,263 INFO L912 BasicCegarLoop]: 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-15 06:21:51,266 INFO L913 BasicCegarLoop]: 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-15 06:21:51,266 INFO L914 BasicCegarLoop]: 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-15 06:21:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:21:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-15 06:21:51,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:51,278 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-15 06:21:51,279 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-15 06:21:51,280 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-15 06:21:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:51,282 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 06:21:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:21:51,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:51,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:51,283 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-15 06:21:51,283 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-15 06:21:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:51,286 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 06:21:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 06:21:51,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:51,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:51,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:51,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:51,287 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-15 06:21:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 06:21:51,288 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-15 06:21:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:51,288 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 06:21:51,289 INFO L479 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-15 06:21:51,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 06:21:51,309 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-15 06:21:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:21:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:21:51,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:51,310 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:51,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:21:51,311 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 1 times [2022-04-15 06:21:51,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:51,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372632294] [2022-04-15 06:21:51,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:51,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:51,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1503489941, now seen corresponding path program 1 times [2022-04-15 06:21:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:52,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712612905] [2022-04-15 06:21:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:21:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:52,204 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-15 06:21:52,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-15 06:21:52,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-15 06:21:52,208 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-15 06:21:52,208 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-15 06:21:52,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-15 06:21:52,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-15 06:21:52,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-15 06:21:52,211 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-15 06:21:52,212 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-15 06:21:52,213 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-15 06:21:52,214 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-15 06:21:52,215 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-15 06:21:52,216 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-15 06:21:52,216 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-15 06:21:52,217 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-15 06:21:52,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {317#false} is VALID [2022-04-15 06:21:52,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-15 06:21:52,218 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-15 06:21:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:52,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712612905] [2022-04-15 06:21:52,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712612905] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:21:52,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192329799] [2022-04-15 06:21:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:52,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:52,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:52,224 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-15 06:21:52,225 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-15 06:21:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:52,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:21:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:52,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:52,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-15 06:21:52,761 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-15 06:21:52,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-15 06:21:52,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-15 06:21:52,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-15 06:21:52,762 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-15 06:21:52,763 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-15 06:21:52,764 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-15 06:21:52,764 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-15 06:21:52,765 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-15 06:21:52,766 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-15 06:21:52,767 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-15 06:21:52,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:21:52,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {317#false} is VALID [2022-04-15 06:21:52,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-15 06:21:52,768 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-15 06:21:52,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:21:53,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-15 06:21:53,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {317#false} is VALID [2022-04-15 06:21:53,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:21:53,264 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-15 06:21:53,264 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-15 06:21:53,265 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-15 06:21:53,266 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-15 06:21:53,268 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-15 06:21:53,268 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-15 06:21:53,269 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-15 06:21:53,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-15 06:21:53,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-15 06:21:53,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-15 06:21:53,269 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-15 06:21:53,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {316#true} is VALID [2022-04-15 06:21:53,270 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-15 06:21:53,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192329799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:21:53,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:21:53,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 18 [2022-04-15 06:21:53,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:53,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372632294] [2022-04-15 06:21:53,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372632294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:53,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:53,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:21:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467469093] [2022-04-15 06:21:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:53,442 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-15 06:21:53,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:53,443 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-15 06:21:53,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:21:53,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:21:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:53,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:21:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:21:53,457 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-15 06:21:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:53,737 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 06:21:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:21:53,738 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-15 06:21:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:21:53,738 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-15 06:21:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 06:21:53,740 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-15 06:21:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-15 06:21:53,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-15 06:21:53,769 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-15 06:21:53,770 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:21:53,770 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:21:53,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:21:53,771 INFO L913 BasicCegarLoop]: 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-15 06:21:53,771 INFO L914 BasicCegarLoop]: 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-15 06:21:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:21:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 06:21:53,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:21:53,780 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-15 06:21:53,780 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-15 06:21:53,780 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-15 06:21:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:53,781 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 06:21:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 06:21:53,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:53,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:53,782 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-15 06:21:53,782 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-15 06:21:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:21:53,783 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 06:21:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 06:21:53,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:21:53,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:21:53,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:21:53,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:21:53,784 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-15 06:21:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-15 06:21:53,785 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2022-04-15 06:21:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:21:53,785 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-15 06:21:53,785 INFO L479 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-15 06:21:53,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-15 06:21:53,807 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-15 06:21:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 06:21:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:21:53,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:21:53,810 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:21:53,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 06:21:54,011 WARN L460 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-15 06:21:54,011 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:21:54,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:21:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 1 times [2022-04-15 06:21:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:21:54,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1508270574] [2022-04-15 06:21:54,411 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-15 06:21:54,751 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-15 06:21:55,113 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-15 06:21:55,507 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:55,559 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:21:55,559 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:21:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash 680619922, now seen corresponding path program 1 times [2022-04-15 06:21:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:21:55,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236163067] [2022-04-15 06:21:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:21:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:21:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:55,875 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-15 06:21:55,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-15 06:21:55,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-15 06:21:55,876 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-15 06:21:55,876 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-15 06:21:55,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-15 06:21:55,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-15 06:21:55,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2022-04-15 06:21:55,878 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-15 06:21:55,878 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-15 06:21:55,879 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-15 06:21:55,880 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-15 06:21:55,881 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-15 06:21:55,881 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-15 06:21:55,882 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-15 06:21:55,883 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-15 06:21:55,884 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-15 06:21:55,885 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-15 06:21:55,885 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-15 06:21:55,886 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-15 06:21:55,887 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-15 06:21:55,887 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-15 06:21:55,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {584#false} is VALID [2022-04-15 06:21:55,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-04-15 06:21:55,888 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-15 06:21:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:21:55,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236163067] [2022-04-15 06:21:55,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236163067] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:21:55,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398346110] [2022-04-15 06:21:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:21:55,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:21:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:21:55,891 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-15 06:21:55,918 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-15 06:21:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:55,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 06:21:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:21:55,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:21:56,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2022-04-15 06:21:56,374 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-15 06:21:56,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-15 06:21:56,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-15 06:21:56,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2022-04-15 06:21:56,375 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-15 06:21:56,375 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-15 06:21:56,376 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-15 06:21:56,377 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-15 06:21:56,379 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-15 06:21:56,379 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-15 06:21:56,380 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-15 06:21:56,382 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-15 06:21:56,383 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-15 06:21:56,391 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-15 06:21:56,395 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-15 06:21:56,396 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-15 06:21:56,396 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-15 06:21:56,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:21:56,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {584#false} is VALID [2022-04-15 06:21:56,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-04-15 06:21:56,399 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-15 06:21:56,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:21:57,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-04-15 06:21:57,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {584#false} is VALID [2022-04-15 06:21:57,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:21:57,671 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-15 06:21:57,672 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-15 06:21:57,672 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-15 06:21:57,673 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-15 06:21:57,674 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-15 06:21:57,675 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-15 06:21:57,676 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-15 06:21:57,677 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-15 06:21:57,678 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-15 06:21:57,679 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-15 06:21:57,681 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-15 06:21:57,682 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-15 06:21:57,682 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-15 06:21:57,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {583#true} call #t~ret4 := main(); {583#true} is VALID [2022-04-15 06:21:57,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {583#true} {583#true} #60#return; {583#true} is VALID [2022-04-15 06:21:57,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {583#true} assume true; {583#true} is VALID [2022-04-15 06:21:57,683 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-15 06:21:57,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {583#true} call ULTIMATE.init(); {583#true} is VALID [2022-04-15 06:21:57,683 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-15 06:21:57,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398346110] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:21:57,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:21:57,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 21 [2022-04-15 06:21:57,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:21:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1508270574] [2022-04-15 06:21:57,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1508270574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:21:57,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:21:57,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:21:57,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589885379] [2022-04-15 06:21:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:21:57,844 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-15 06:21:57,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:21:57,844 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-15 06:21:57,853 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-15 06:21:57,872 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-15 06:21:58,065 WARN L460 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-15 06:21:58,066 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 06:21:58,070 INFO L158 Benchmark]: Toolchain (without parser) took 8499.23ms. Allocated memory was 199.2MB in the beginning and 304.1MB in the end (delta: 104.9MB). Free memory was 142.9MB in the beginning and 105.8MB in the end (delta: 37.0MB). Peak memory consumption was 141.3MB. Max. memory is 8.0GB. [2022-04-15 06:21:58,070 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:21:58,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.74ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 142.6MB in the beginning and 222.7MB in the end (delta: -80.1MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. [2022-04-15 06:21:58,071 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 252.7MB. Free memory was 222.7MB in the beginning and 221.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:21:58,071 INFO L158 Benchmark]: RCFGBuilder took 259.97ms. Allocated memory is still 252.7MB. Free memory was 221.2MB in the beginning and 209.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 06:21:58,071 INFO L158 Benchmark]: TraceAbstraction took 7966.61ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 209.2MB in the beginning and 105.8MB in the end (delta: 103.4MB). Peak memory consumption was 155.9MB. Max. memory is 8.0GB. [2022-04-15 06:21:58,072 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.74ms. Allocated memory was 199.2MB in the beginning and 252.7MB in the end (delta: 53.5MB). Free memory was 142.6MB in the beginning and 222.7MB in the end (delta: -80.1MB). Peak memory consumption was 8.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 252.7MB. Free memory was 222.7MB in the beginning and 221.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.97ms. Allocated memory is still 252.7MB. Free memory was 221.2MB in the beginning and 209.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7966.61ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 209.2MB in the beginning and 105.8MB in the end (delta: 103.4MB). Peak memory consumption was 155.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 06:21:58,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...