/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/count_by_k.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:59:51,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:59:51,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:59:51,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:59:51,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:59:51,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:59:51,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:59:51,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:59:51,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:59:51,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:59:51,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:59:51,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:59:51,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:59:51,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:59:51,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:59:51,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:59:51,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:59:51,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:59:51,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:59:51,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:59:51,780 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:59:51,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:59:51,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:59:51,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:59:51,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:59:51,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:59:51,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:59:51,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:59:51,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:59:51,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:59:51,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:59:51,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:59:51,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:59:51,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:59:51,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:59:51,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:59:51,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:59:51,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:59:51,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:59:51,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:59:51,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:59:51,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:59:51,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:59:51,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:59:51,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:59:51,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:59:51,812 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:59:51,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:59:51,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:59:51,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:59:51,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:59:51,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:59:51,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:59:51,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:59:51,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:59:51,814 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:59:51,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:59:51,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:59:51,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:59:51,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:59:51,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:59:51,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:59:51,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:59:51,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:59:51,815 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:59:51,815 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:59:51,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:59:51,815 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:59:51,816 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-08 03:59:52,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:59:52,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:59:52,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:59:52,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:59:52,087 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:59:52,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_k.i [2022-04-08 03:59:52,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc41d26df/c537da72a2de4d6d86c42e32361efbe0/FLAG31e303ac0 [2022-04-08 03:59:52,510 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:59:52,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i [2022-04-08 03:59:52,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc41d26df/c537da72a2de4d6d86c42e32361efbe0/FLAG31e303ac0 [2022-04-08 03:59:52,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc41d26df/c537da72a2de4d6d86c42e32361efbe0 [2022-04-08 03:59:52,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:59:52,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:59:52,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:59:52,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:59:52,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:59:52,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:59:52" (1/1) ... [2022-04-08 03:59:52,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a23e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:52, skipping insertion in model container [2022-04-08 03:59:52,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:59:52" (1/1) ... [2022-04-08 03:59:52,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:59:52,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:59:53,091 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/count_by_k.i[891,904] [2022-04-08 03:59:53,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:59:53,107 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:59:53,118 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/count_by_k.i[891,904] [2022-04-08 03:59:53,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:59:53,132 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:59:53,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53 WrapperNode [2022-04-08 03:59:53,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:59:53,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:59:53,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:59:53,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:59:53,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:59:53,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:59:53,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:59:53,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:59:53,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (1/1) ... [2022-04-08 03:59:53,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:59:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:59:53,188 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-08 03:59:53,199 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-08 03:59:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:59:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:59:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:59:53,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:59:53,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:59:53,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:59:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:59:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:59:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:59:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:59:53,234 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:59:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:59:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:59:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:59:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:59:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:59:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:59:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:59:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:59:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:59:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:59:53,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:59:53,302 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:59:53,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:59:53,461 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:59:53,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:59:53,474 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:59:53,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:59:53 BoogieIcfgContainer [2022-04-08 03:59:53,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:59:53,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:59:53,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:59:53,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:59:53,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:59:52" (1/3) ... [2022-04-08 03:59:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970e41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:59:53, skipping insertion in model container [2022-04-08 03:59:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:59:53" (2/3) ... [2022-04-08 03:59:53,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970e41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:59:53, skipping insertion in model container [2022-04-08 03:59:53,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:59:53" (3/3) ... [2022-04-08 03:59:53,482 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_k.i [2022-04-08 03:59:53,486 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:59:53,486 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:59:53,519 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:59:53,524 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-08 03:59:53,525 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:59:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-08 03:59:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:59:53,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:53,545 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:53,546 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 1 times [2022-04-08 03:59:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:53,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [529376021] [2022-04-08 03:59:53,566 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:59:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 2 times [2022-04-08 03:59:53,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:59:53,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927979736] [2022-04-08 03:59:53,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:59:53,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:59:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:59:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:59:53,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-08 03:59:53,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 03:59:53,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-08 03:59:53,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:59:53,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-08 03:59:53,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-08 03:59:53,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-08 03:59:53,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2022-04-08 03:59:53,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2022-04-08 03:59:53,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {29#(or (and (<= 0 main_~k~0) (= main_~i~0 0)) (= (* main_~k~0 1000000) main_~i~0))} is VALID [2022-04-08 03:59:53,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(or (and (<= 0 main_~k~0) (= main_~i~0 0)) (= (* main_~k~0 1000000) main_~i~0))} assume !(~i~0 < 1000000 * ~k~0); {30#(= (* main_~k~0 1000000) main_~i~0)} is VALID [2022-04-08 03:59:53,978 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(= (* main_~k~0 1000000) main_~i~0)} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:59:53,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:59:53,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-08 03:59:53,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 03:59:53,980 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-08 03:59:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:59:53,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927979736] [2022-04-08 03:59:53,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927979736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:53,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:53,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:59:53,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:59:53,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [529376021] [2022-04-08 03:59:53,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [529376021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:59:53,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:59:53,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:59:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397759490] [2022-04-08 03:59:53,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:59:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 03:59:53,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:59:53,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,022 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-08 03:59:54,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:59:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:54,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:59:54,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:59:54,056 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:54,420 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-08 03:59:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:59:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 03:59:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:59:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 03:59:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 03:59:54,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-08 03:59:54,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:59:54,488 INFO L225 Difference]: With dead ends: 43 [2022-04-08 03:59:54,488 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 03:59:54,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:59:54,493 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:59:54,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 45 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:59:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 03:59:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-08 03:59:54,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:59:54,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,520 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,520 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:54,522 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 03:59:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 03:59:54,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:54,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:54,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 03:59:54,523 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 03:59:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:59:54,525 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-08 03:59:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-08 03:59:54,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:59:54,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:59:54,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:59:54,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:59:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 03:59:54,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-08 03:59:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:59:54,529 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 03:59:54,529 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:59:54,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 03:59:54,547 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-08 03:59:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 03:59:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:59:54,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:59:54,548 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:59:54,548 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:59:54,548 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:59:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:59:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 1 times [2022-04-08 03:59:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:59:54,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [26863613] [2022-04-08 03:59:58,561 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:00:02,898 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:00:07,236 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:00:07,539 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:07,543 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:00:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash 562650993, now seen corresponding path program 1 times [2022-04-08 04:00:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:07,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783942676] [2022-04-08 04:00:07,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:07,578 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:00:07,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814004106] [2022-04-08 04:00:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:07,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:07,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:07,603 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-08 04:00:07,610 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-08 04:00:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:07,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 04:00:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:07,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:09,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-08 04:00:09,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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); {202#(= (select |#valid| 2) 1)} is VALID [2022-04-08 04:00:09,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {202#(= (select |#valid| 2) 1)} assume true; {202#(= (select |#valid| 2) 1)} is VALID [2022-04-08 04:00:09,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202#(= (select |#valid| 2) 1)} {194#true} #55#return; {194#true} is VALID [2022-04-08 04:00:09,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret2 := main(); {194#true} is VALID [2022-04-08 04:00:09,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-08 04:00:09,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {218#(and (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-08 04:00:09,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 0 main_~k~0) (= main_~i~0 0))} [59] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse1 (* v_main_~k~0_11 1000000))) (or (and .cse0 (<= .cse1 v_main_~i~0_10)) (and .cse0 (= v_main_~k~0_11 v_main_~k~0_11)) (and (let ((.cse2 (= v_main_~k~0_11 0))) (or (and .cse0 .cse2) (let ((.cse3 (+ (* v_main_~i~0_10 (- 1)) v_main_~i~0_9))) (and (= (mod .cse3 v_main_~k~0_11) 0) (forall ((v_it_1 Int)) (or (< (+ (* v_main_~k~0_11 v_it_1) v_main_~i~0_10) (* v_main_~k~0_11 1000000)) (not (<= (+ v_it_1 1) (div (+ (* v_main_~i~0_10 (- 1)) v_main_~i~0_9) v_main_~k~0_11))) (not (<= 1 v_it_1)))) (< 0 (div .cse3 v_main_~k~0_11)) (not .cse2))))) (< v_main_~i~0_10 .cse1)))) InVars {main_~i~0=v_main_~i~0_10, main_~k~0=v_main_~k~0_11} OutVars{main_~i~0=v_main_~i~0_9, main_~k~0=v_main_~k~0_11} AuxVars[] AssignedVars[main_~i~0] {222#(and (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)) (<= 0 main_~k~0))} is VALID [2022-04-08 04:00:09,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {222#(and (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)) (<= 0 main_~k~0))} [58] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_3 (* v_main_~k~0_4 1000000))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_3} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {226#(and (<= 0 main_~k~0) (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0)) (= main_~i~0 0)) (not (< main_~i~0 (* main_~k~0 1000000))))} is VALID [2022-04-08 04:00:09,893 INFO L272 TraceCheckUtils]: 9: Hoare triple {226#(and (<= 0 main_~k~0) (or (and (forall ((v_it_1 Int)) (or (< (* v_it_1 main_~k~0) (* main_~k~0 1000000)) (not (<= (+ v_it_1 1) (div main_~i~0 main_~k~0))))) (= (mod main_~i~0 main_~k~0) 0)) (= main_~i~0 0)) (not (< main_~i~0 (* main_~k~0 1000000))))} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:00:09,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:00:09,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-08 04:00:09,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-08 04:00:09,895 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-08 04:00:09,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:00:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783942676] [2022-04-08 04:00:09,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:00:09,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814004106] [2022-04-08 04:00:09,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814004106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:09,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:09,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:00:12,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:12,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [26863613] [2022-04-08 04:00:12,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [26863613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:12,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:12,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:00:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575947011] [2022-04-08 04:00:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:12,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:00:12,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:12,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-08 04:00:12,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:12,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 04:00:12,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:12,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 04:00:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-08 04:00:12,591 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-08 04:00:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:15,140 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 04:00:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:00:15,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 04:00:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:00:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-08 04:00:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-08 04:00:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-08 04:00:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-08 04:00:15,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 22 transitions. [2022-04-08 04:00:15,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:15,174 INFO L225 Difference]: With dead ends: 22 [2022-04-08 04:00:15,174 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 04:00:15,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=28, Invalid=102, Unknown=2, NotChecked=0, Total=132 [2022-04-08 04:00:15,176 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:00:15,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-04-08 04:00:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 04:00:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 04:00:15,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:00:15,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-08 04:00:15,191 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-08 04:00:15,191 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-08 04:00:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:15,192 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 04:00:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 04:00:15,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:15,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:15,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 17 states. [2022-04-08 04:00:15,193 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 17 states. [2022-04-08 04:00:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:00:15,194 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 04:00:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 04:00:15,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:00:15,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:00:15,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:00:15,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:00:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-08 04:00:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 04:00:15,196 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-08 04:00:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:00:15,197 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 04:00:15,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-08 04:00:15,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 04:00:15,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:00:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 04:00:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:00:15,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:00:15,218 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:00:15,226 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-08 04:00:15,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:15,423 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:00:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:00:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 2 times [2022-04-08 04:00:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:15,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675363290] [2022-04-08 04:00:19,159 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:00:23,510 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:00:29,691 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:00:30,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:00:30,032 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:00:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash 621756337, now seen corresponding path program 1 times [2022-04-08 04:00:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:00:30,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943960549] [2022-04-08 04:00:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:00:30,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:00:30,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164895807] [2022-04-08 04:00:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:00:30,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:00:30,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:00:30,066 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-08 04:00:30,066 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-08 04:00:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:30,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 04:00:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:00:30,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:00:33,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {358#true} call ULTIMATE.init(); {358#true} is VALID [2022-04-08 04:00:33,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {358#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); {366#(= (select |#valid| 2) 1)} is VALID [2022-04-08 04:00:33,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {366#(= (select |#valid| 2) 1)} assume true; {366#(= (select |#valid| 2) 1)} is VALID [2022-04-08 04:00:33,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {366#(= (select |#valid| 2) 1)} {358#true} #55#return; {358#true} is VALID [2022-04-08 04:00:33,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {358#true} call #t~ret2 := main(); {358#true} is VALID [2022-04-08 04:00:33,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {358#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {358#true} is VALID [2022-04-08 04:00:33,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {382#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-08 04:00:33,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#(and (<= main_~k~0 10) (<= 0 main_~k~0) (= main_~i~0 0))} [61] L29-3-->L29-4_primed: Formula: (let ((.cse1 (* v_main_~k~0_13 1000000)) (.cse0 (= v_main_~i~0_18 v_main_~i~0_17))) (or (and .cse0 (= v_main_~k~0_13 v_main_~k~0_13)) (and .cse0 (<= .cse1 v_main_~i~0_18)) (and (< v_main_~i~0_18 .cse1) (let ((.cse3 (= v_main_~k~0_13 0))) (or (let ((.cse2 (+ v_main_~i~0_17 (* v_main_~i~0_18 (- 1))))) (and (< 0 (div .cse2 v_main_~k~0_13)) (not .cse3) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 1) (div (+ v_main_~i~0_17 (* v_main_~i~0_18 (- 1))) v_main_~k~0_13))) (< (+ v_main_~i~0_18 (* v_main_~k~0_13 v_it_2)) (* v_main_~k~0_13 1000000)))) (= (mod .cse2 v_main_~k~0_13) 0))) (and .cse0 .cse3)))))) InVars {main_~i~0=v_main_~i~0_18, main_~k~0=v_main_~k~0_13} OutVars{main_~i~0=v_main_~i~0_17, main_~k~0=v_main_~k~0_13} AuxVars[] AssignedVars[main_~i~0] {386#(and (<= main_~k~0 10) (<= 0 main_~k~0) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) (div main_~i~0 main_~k~0))) (< (* v_it_2 main_~k~0) (* main_~k~0 1000000)))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)))} is VALID [2022-04-08 04:00:33,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= main_~k~0 10) (<= 0 main_~k~0) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) (div main_~i~0 main_~k~0))) (< (* v_it_2 main_~k~0) (* main_~k~0 1000000)))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)))} [60] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_3 (* v_main_~k~0_4 1000000))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_3} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_3} AuxVars[] AssignedVars[] {390#(and (or (= main_~i~0 0) (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) (div main_~i~0 main_~k~0))) (< (* v_it_2 main_~k~0) (* main_~k~0 1000000)))) (= (mod main_~i~0 main_~k~0) 0))) (<= main_~k~0 10) (<= 0 main_~k~0) (not (< main_~i~0 (* main_~k~0 1000000))))} is VALID [2022-04-08 04:00:33,740 INFO L272 TraceCheckUtils]: 9: Hoare triple {390#(and (or (= main_~i~0 0) (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) (div main_~i~0 main_~k~0))) (< (* v_it_2 main_~k~0) (* main_~k~0 1000000)))) (= (mod main_~i~0 main_~k~0) 0))) (<= main_~k~0 10) (<= 0 main_~k~0) (not (< main_~i~0 (* main_~k~0 1000000))))} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {394#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:00:33,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {394#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {398#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:00:33,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {359#false} is VALID [2022-04-08 04:00:33,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {359#false} assume !false; {359#false} is VALID [2022-04-08 04:00:33,741 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-08 04:00:33,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:00:33,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:00:33,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943960549] [2022-04-08 04:00:33,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:00:33,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164895807] [2022-04-08 04:00:33,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164895807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:33,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:33,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:00:53,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:00:53,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675363290] [2022-04-08 04:00:53,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675363290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:00:53,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:00:53,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:00:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9235886] [2022-04-08 04:00:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:00:53,098 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-04-08 04:00:53,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:00:53,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 04:00:53,120 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-08 04:00:53,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:00:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:00:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:00:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=97, Unknown=8, NotChecked=0, Total=132 [2022-04-08 04:00:53,121 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 04:01:23,708 WARN L232 SmtUtils]: Spent 26.16s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:01:57,933 WARN L232 SmtUtils]: Spent 26.16s on a formula simplification. DAG size of input: 44 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:01:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:01:58,041 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 04:01:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:01:58,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-04-08 04:01:58,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:01:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 04:01:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2022-04-08 04:01:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 04:01:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2022-04-08 04:01:58,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2022-04-08 04:02:02,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:02,093 INFO L225 Difference]: With dead ends: 17 [2022-04-08 04:02:02,093 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 04:02:02,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 84.1s TimeCoverageRelationStatistics Valid=46, Invalid=181, Unknown=13, NotChecked=0, Total=240 [2022-04-08 04:02:02,094 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:02:02,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-04-08 04:02:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 04:02:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 04:02:02,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:02:02,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:02:02,096 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:02:02,096 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:02:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:02,096 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:02:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:02:02,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:02,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:02,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 04:02:02,097 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 04:02:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:02:02,097 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 04:02:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:02:02,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:02,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:02:02,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:02:02,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:02:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 04:02:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 04:02:02,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-08 04:02:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:02:02,098 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 04:02:02,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 04:02:02,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 04:02:02,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:02:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 04:02:02,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:02:02,101 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 04:02:02,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 04:02:02,302 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,SelfDestructingSolverStorable2 [2022-04-08 04:02:02,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 04:02:18,483 WARN L232 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 80 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 04:02:39,866 WARN L232 SmtUtils]: Spent 21.36s on a formula simplification. DAG size of input: 52 DAG size of output: 31 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 04:02:40,221 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 04:02:40,222 INFO L885 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-04-08 04:02:40,223 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2022-04-08 04:02:40,223 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 04:02:40,223 INFO L878 garLoopResultBuilder]: At program point L29-2(line 29) the Hoare annotation is: (or (and (<= main_~k~0 10) (or (and (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) (div main_~i~0 main_~k~0))) (< (* v_it_2 main_~k~0) (* main_~k~0 1000000)))) (= (mod main_~i~0 main_~k~0) 0) (< 0 (div main_~i~0 main_~k~0))) (= main_~i~0 0)) (< main_~i~0 (* main_~k~0 1000000))) (not (= (select |#valid| 2) 1))) [2022-04-08 04:02:40,223 INFO L878 garLoopResultBuilder]: At program point L29-3(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 10))) (or (and .cse0 (< main_~i~0 (* 1000001 main_~k~0)) (or (= main_~i~0 main_~k~0) (let ((.cse1 (+ (* (- 1) main_~k~0) main_~i~0))) (and (= (mod .cse1 main_~k~0) 0) (< 0 (div .cse1 main_~k~0)) (forall ((v_it_2 Int)) (or (not (<= (+ v_it_2 1) (div (+ (* (- 1) main_~k~0) main_~i~0) main_~k~0))) (< (* v_it_2 main_~k~0) (* main_~k~0 1000000)))))))) (and .cse0 (<= 0 main_~k~0) (= main_~i~0 0)) (not (= (select |#valid| 2) 1)))) [2022-04-08 04:02:40,223 INFO L878 garLoopResultBuilder]: At program point L29-4(line 29) the Hoare annotation is: (or (not (= (select |#valid| 2) 1)) (= (* main_~k~0 1000000) main_~i~0)) [2022-04-08 04:02:40,223 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 32) the Hoare annotation is: true [2022-04-08 04:02:40,223 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 32) the Hoare annotation is: true [2022-04-08 04:02:40,224 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= (select |#valid| 2) 1) [2022-04-08 04:02:40,224 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 04:02:40,224 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= (select |#valid| 2) 1) [2022-04-08 04:02:40,224 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 04:02:40,224 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= (select |#valid| 2) 1) [2022-04-08 04:02:40,224 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 04:02:40,224 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 04:02:40,224 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 04:02:40,224 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 04:02:40,225 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 04:02:40,225 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 04:02:40,225 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 04:02:40,225 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 04:02:40,228 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-08 04:02:40,229 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 04:02:40,232 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:02:40,232 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 04:02:40,234 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 04:02:40,234 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 04:02:40,235 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 04:02:40,235 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 04:02:40,238 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 04:02:42,251 INFO L163 areAnnotationChecker]: CFG has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 04:02:42,255 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 04:02:42 BoogieIcfgContainer [2022-04-08 04:02:42,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 04:02:42,261 INFO L158 Benchmark]: Toolchain (without parser) took 169332.60ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 137.5MB in the beginning and 135.0MB in the end (delta: 2.5MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB. [2022-04-08 04:02:42,262 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:02:42,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.86ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 162.5MB in the end (delta: -25.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:02:42,262 INFO L158 Benchmark]: Boogie Preprocessor took 26.55ms. Allocated memory is still 184.5MB. Free memory was 162.5MB in the beginning and 161.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:02:42,263 INFO L158 Benchmark]: RCFGBuilder took 315.63ms. Allocated memory is still 184.5MB. Free memory was 161.2MB in the beginning and 150.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 04:02:42,263 INFO L158 Benchmark]: TraceAbstraction took 168783.65ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 150.3MB in the beginning and 135.0MB in the end (delta: 15.4MB). Peak memory consumption was 69.8MB. Max. memory is 8.0GB. [2022-04-08 04:02:42,264 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 153.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.86ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 162.5MB in the end (delta: -25.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.55ms. Allocated memory is still 184.5MB. Free memory was 162.5MB in the beginning and 161.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 315.63ms. Allocated memory is still 184.5MB. Free memory was 161.2MB in the beginning and 150.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 168783.65ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 150.3MB in the beginning and 135.0MB in the end (delta: 15.4MB). Peak memory consumption was 69.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 166.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 72.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 37 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 36 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 89.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 39 PreInvPairs, 59 NumberOfFragments, 200 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 407 FormulaSimplificationTreeSizeReductionInter, 37.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2022-04-08 04:02:42,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] [2022-04-08 04:02:42,272 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_it_2,QUANTIFIED] Derived loop invariant: (((k <= 10 && i < 1000001 * k) && (i == k || (((-1 * k + i) % k == 0 && 0 < (-1 * k + i) / k) && (forall v_it_2 : int :: !(v_it_2 + 1 <= (-1 * k + i) / k) || v_it_2 * k < k * 1000000)))) || ((k <= 10 && 0 <= k) && i == 0)) || !(\valid[2] == 1) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 04:02:42,319 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...