/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-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:13:40,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:13:40,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:13:40,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:13:40,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:13:40,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:13:40,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:13:40,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:13:40,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:13:40,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:13:40,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:13:40,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:13:40,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:13:40,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:13:40,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:13:40,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:13:40,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:13:40,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:13:40,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:13:40,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:13:40,638 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:13:40,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:13:40,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:13:40,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:13:40,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:13:40,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:13:40,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:13:40,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:13:40,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:13:40,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:13:40,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:13:40,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:13:40,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:13:40,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:13:40,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:13:40,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:13:40,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:13:40,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:13:40,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:13:40,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:13:40,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:13:40,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:13:40,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:13:40,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:13:40,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:13:40,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:13:40,672 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:13:40,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:13:40,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:13:40,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:13:40,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:13:40,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:13:40,673 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:13:40,673 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:13:40,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:13:40,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:13:40,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:13:40,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:13:40,675 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:13:40,675 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:13:40,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:13:40,675 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:13:40,675 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:13:40,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:13:40,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:13:40,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:13:40,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:13:40,844 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:13:40,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-28 03:13:40,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81334f603/5ce55b7a48894aec96581d02c4549caa/FLAGd1d15e69e [2022-04-28 03:13:41,291 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:13:41,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2022-04-28 03:13:41,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81334f603/5ce55b7a48894aec96581d02c4549caa/FLAGd1d15e69e [2022-04-28 03:13:41,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81334f603/5ce55b7a48894aec96581d02c4549caa [2022-04-28 03:13:41,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:13:41,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:13:41,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:13:41,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:13:41,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:13:41,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123fa691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41, skipping insertion in model container [2022-04-28 03:13:41,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:13:41,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:13:41,496 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-lit/gsv2008.i[895,908] [2022-04-28 03:13:41,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:13:41,537 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:13:41,544 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-lit/gsv2008.i[895,908] [2022-04-28 03:13:41,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:13:41,554 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:13:41,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41 WrapperNode [2022-04-28 03:13:41,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:13:41,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:13:41,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:13:41,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:13:41,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:13:41,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:13:41,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:13:41,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:13:41,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (1/1) ... [2022-04-28 03:13:41,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:13:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:41,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:13:41,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:13:41,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:13:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:13:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:13:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:13:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:13:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:13:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:13:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:13:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:13:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:13:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:13:41,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:13:41,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:13:41,679 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:13:41,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:13:41,784 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:13:41,789 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:13:41,789 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:13:41,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:13:41 BoogieIcfgContainer [2022-04-28 03:13:41,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:13:41,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:13:41,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:13:41,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:13:41,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:13:41" (1/3) ... [2022-04-28 03:13:41,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715caf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:13:41, skipping insertion in model container [2022-04-28 03:13:41,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:13:41" (2/3) ... [2022-04-28 03:13:41,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715caf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:13:41, skipping insertion in model container [2022-04-28 03:13:41,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:13:41" (3/3) ... [2022-04-28 03:13:41,796 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2022-04-28 03:13:41,805 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:13:41,805 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:13:41,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:13:41,838 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19b2bd45, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4232cccd [2022-04-28 03:13:41,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:13:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:13:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:13:41,849 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:41,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:41,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:41,854 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 1 times [2022-04-28 03:13:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477497763] [2022-04-28 03:13:41,867 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:13:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash 253912119, now seen corresponding path program 2 times [2022-04-28 03:13:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:41,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206831668] [2022-04-28 03:13:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:41,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:13:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:42,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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); {23#true} is VALID [2022-04-28 03:13:42,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:13:42,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-28 03:13:42,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:13:42,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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); {23#true} is VALID [2022-04-28 03:13:42,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 03:13:42,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-28 03:13:42,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-28 03:13:42,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {28#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 03:13:42,007 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {28#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 03:13:42,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~x~0 50) 0)} assume !(~x~0 < 0); {24#false} is VALID [2022-04-28 03:13:42,008 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {24#false} is VALID [2022-04-28 03:13:42,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 03:13:42,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 03:13:42,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 03:13:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:13:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:13:42,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206831668] [2022-04-28 03:13:42,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206831668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:42,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:42,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:13:42,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:13:42,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477497763] [2022-04-28 03:13:42,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477497763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:13:42,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:13:42,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:13:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061013627] [2022-04-28 03:13:42,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:13:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:13:42,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:13:42,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:42,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:13:42,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:42,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:13:42,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:13:42,084 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:42,231 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 03:13:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:13:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:13:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:13:42,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 03:13:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-28 03:13:42,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-28 03:13:42,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:13:42,294 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:13:42,295 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:13:42,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:13:42,302 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:13:42,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:13:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:13:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:13:42,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:13:42,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,335 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,336 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:42,340 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:13:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:13:42,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:42,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:42,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 14 states. [2022-04-28 03:13:42,340 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 14 states. [2022-04-28 03:13:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:13:42,343 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:13:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:13:42,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:13:42,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:13:42,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:13:42,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:13:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 03:13:42,346 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 03:13:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:13:42,349 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 03:13:42,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:13:42,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 03:13:42,368 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-28 03:13:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:13:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:13:42,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:13:42,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:13:42,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:13:42,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:13:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:13:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash -684163825, now seen corresponding path program 1 times [2022-04-28 03:13:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:13:42,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413221043] [2022-04-28 03:13:43,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:13:43,726 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:13:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash 203339856, now seen corresponding path program 1 times [2022-04-28 03:13:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:13:43,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780063641] [2022-04-28 03:13:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:13:43,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:13:43,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069904462] [2022-04-28 03:13:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:13:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:13:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:13:43,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:13:43,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:13:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:44,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:13:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:13:44,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:14:46,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2022-04-28 03:14:46,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#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); {160#true} is VALID [2022-04-28 03:14:46,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2022-04-28 03:14:46,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #54#return; {160#true} is VALID [2022-04-28 03:14:46,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret3 := main(); {160#true} is VALID [2022-04-28 03:14:46,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {180#(= main_~x~0 (- 50))} is VALID [2022-04-28 03:14:46,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {180#(= main_~x~0 (- 50))} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {180#(= main_~x~0 (- 50))} is VALID [2022-04-28 03:14:48,815 WARN L290 TraceCheckUtils]: 7: Hoare triple {180#(= main_~x~0 (- 50))} [58] L29-2-->L29-3_primed: Formula: (let ((.cse1 (< v_main_~x~0_8 0)) (.cse2 (* (- 1) v_main_~y~0_10)) (.cse4 (= v_main_~x~0_8 v_main_~x~0_7)) (.cse5 (= v_main_~y~0_11 v_main_~y~0_10)) (.cse6 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (let ((.cse0 (div (+ v_main_~y~0_11 .cse2) (- 2)))) (and (< 0 .cse0) (= (+ v_main_~x~0_7 .cse0) (+ v_main_~x~0_8 (* (* .cse0 .cse0) 2) (* 2 (* v_main_~y~0_11 .cse0)))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_main_~y~0_11 (* (- 1) v_main_~y~0_10)) (- 2)))) (not (<= 0 v_itHalf_1)) (< (+ v_main_~y~0_11 v_main_~x~0_8 v_itHalf_1 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_11 v_itHalf_1))) 0))) (= (mod (+ v_main_~y~0_11 v_main_~y~0_10) 2) 0) .cse1)) (let ((.cse3 (div (+ v_main_~y~0_11 .cse2 1) (- 2)))) (and (= (mod (+ v_main_~y~0_11 v_main_~y~0_10 1) 2) 0) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (not (<= v_itHalf_1 (div (+ v_main_~y~0_11 (* (- 1) v_main_~y~0_10) 1) (- 2)))) (< (+ v_main_~x~0_8 (* 2 (* v_itHalf_1 v_itHalf_1)) (* 2 (* v_main_~y~0_11 v_itHalf_1))) v_itHalf_1))) (= v_main_~x~0_7 (+ v_main_~y~0_11 v_main_~x~0_8 (* 2 (* .cse3 .cse3)) (* 2 (* v_main_~y~0_11 .cse3)) .cse3)) (<= 0 .cse3) .cse1)) (and .cse4 .cse5 .cse6) (and .cse4 (<= 0 v_main_~x~0_8) .cse5 .cse6))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post2=|v_main_#t~post2_4|, main_~x~0=v_main_~x~0_8} OutVars{main_~y~0=v_main_~y~0_10, main_#t~post2=|v_main_#t~post2_3|, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {187#(or (exists ((aux_div_aux_mod_v_main_~y~0_12_50_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 Int)) (and (= (+ main_~x~0 (* 2 (* aux_div_aux_mod_v_main_~y~0_12_50_77 aux_div_aux_mod_v_main_~y~0_12_50_77)) aux_div_aux_mod_v_main_~y~0_12_50_77 50) (+ (* 2 (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_50_77)) (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 aux_div_aux_mod_v_main_~y~0_12_50_77) (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_50_77) 4) 50)) (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1 1) aux_div_aux_mod_v_main_~y~0_12_50_77)))) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) 2) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2)))) (exists ((aux_div_aux_mod_v_main_~y~0_12_52_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 (+ aux_div_aux_mod_v_main_~y~0_12_52_77 1)) (= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_52_77) 2)) (+ 51 main_~x~0 (* (* aux_div_aux_mod_v_main_~y~0_12_52_77 aux_div_aux_mod_v_main_~y~0_12_52_77) 2) (* 3 aux_div_aux_mod_v_main_~y~0_12_52_77))) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) aux_div_aux_mod_v_main_~y~0_12_52_77)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) (* 4 (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* v_itHalf_1 3) 50)))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) 2))) (= main_~x~0 (- 50)))} is UNKNOWN [2022-04-28 03:14:49,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#(or (exists ((aux_div_aux_mod_v_main_~y~0_12_50_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 Int)) (and (= (+ main_~x~0 (* 2 (* aux_div_aux_mod_v_main_~y~0_12_50_77 aux_div_aux_mod_v_main_~y~0_12_50_77)) aux_div_aux_mod_v_main_~y~0_12_50_77 50) (+ (* 2 (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_50_77)) (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 aux_div_aux_mod_v_main_~y~0_12_50_77) (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_50_77) 4) 50)) (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1 1) aux_div_aux_mod_v_main_~y~0_12_50_77)))) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) 2) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2)))) (exists ((aux_div_aux_mod_v_main_~y~0_12_52_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 (+ aux_div_aux_mod_v_main_~y~0_12_52_77 1)) (= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_52_77) 2)) (+ 51 main_~x~0 (* (* aux_div_aux_mod_v_main_~y~0_12_52_77 aux_div_aux_mod_v_main_~y~0_12_52_77) 2) (* 3 aux_div_aux_mod_v_main_~y~0_12_52_77))) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) aux_div_aux_mod_v_main_~y~0_12_52_77)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) (* 4 (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* v_itHalf_1 3) 50)))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) 2))) (= main_~x~0 (- 50)))} [57] L29-3_primed-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {191#(or (exists ((aux_div_aux_mod_v_main_~y~0_12_50_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 Int)) (and (not (< (+ (* 2 (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_50_77)) (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) 4)) (+ (* 2 (* aux_div_aux_mod_v_main_~y~0_12_50_77 aux_div_aux_mod_v_main_~y~0_12_50_77)) aux_div_aux_mod_v_main_~y~0_12_50_77 50))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 aux_div_aux_mod_v_main_~y~0_12_50_77) (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_50_77) 4) 50)) (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1 1) aux_div_aux_mod_v_main_~y~0_12_50_77)))) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) 2) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2)))) (exists ((aux_div_aux_mod_v_main_~y~0_12_52_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 (+ aux_div_aux_mod_v_main_~y~0_12_52_77 1)) (not (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_52_77) 2)) (+ 51 (* (* aux_div_aux_mod_v_main_~y~0_12_52_77 aux_div_aux_mod_v_main_~y~0_12_52_77) 2) (* 3 aux_div_aux_mod_v_main_~y~0_12_52_77)))) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) aux_div_aux_mod_v_main_~y~0_12_52_77)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) (* 4 (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* v_itHalf_1 3) 50)))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) 2))))} is VALID [2022-04-28 03:14:49,154 INFO L272 TraceCheckUtils]: 9: Hoare triple {191#(or (exists ((aux_div_aux_mod_v_main_~y~0_12_50_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 Int)) (and (not (< (+ (* 2 (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_50_77)) (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) 4)) (+ (* 2 (* aux_div_aux_mod_v_main_~y~0_12_50_77 aux_div_aux_mod_v_main_~y~0_12_50_77)) aux_div_aux_mod_v_main_~y~0_12_50_77 50))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) v_itHalf_1 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1) 4) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* 2 aux_div_aux_mod_v_main_~y~0_12_50_77) (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_50_77) 4) 50)) (not (<= (+ aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 v_itHalf_1 1) aux_div_aux_mod_v_main_~y~0_12_50_77)))) (< (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2) 2) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 aux_div_aux_mod_v_main_~y~0_12_50_77) (<= 0 (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_50_77_44 2)))) (exists ((aux_div_aux_mod_v_main_~y~0_12_52_77 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 Int)) (and (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (< aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 (+ aux_div_aux_mod_v_main_~y~0_12_52_77 1)) (not (< (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) main_~y~0 (* (* aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* (* main_~y~0 aux_div_aux_mod_v_main_~y~0_12_52_77) 2)) (+ 51 (* (* aux_div_aux_mod_v_main_~y~0_12_52_77 aux_div_aux_mod_v_main_~y~0_12_52_77) 2) (* 3 aux_div_aux_mod_v_main_~y~0_12_52_77)))) (forall ((v_itHalf_1 Int)) (or (not (<= 1 v_itHalf_1)) (not (<= (+ v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) aux_div_aux_mod_v_main_~y~0_12_52_77)) (< (+ (* 2 (* v_itHalf_1 main_~y~0)) (* 4 (* v_itHalf_1 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44)) (* 2 (* v_itHalf_1 v_itHalf_1))) (+ (* (* v_itHalf_1 aux_div_aux_mod_v_main_~y~0_12_52_77) 4) (* v_itHalf_1 3) 50)))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_12_52_77_44) 2))))} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {195#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 03:14:49,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {199#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 03:14:49,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {161#false} is VALID [2022-04-28 03:14:49,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#false} assume !false; {161#false} is VALID [2022-04-28 03:14:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:14:49,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:14:49,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:14:49,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780063641] [2022-04-28 03:14:49,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:14:49,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069904462] [2022-04-28 03:14:49,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069904462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:14:49,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:14:49,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:15:37,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:15:37,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413221043] [2022-04-28 03:15:37,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413221043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:15:37,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:15:37,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:15:37,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994518088] [2022-04-28 03:15:37,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:15:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 13 [2022-04-28 03:15:37,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:15:37,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-28 03:15:41,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 11 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:41,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:15:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:15:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2022-04-28 03:15:41,885 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-28 03:15:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:42,029 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:15:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:15:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 13 [2022-04-28 03:15:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:15:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-28 03:15:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 03:15:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-28 03:15:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-04-28 03:15:42,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2022-04-28 03:15:44,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:44,075 INFO L225 Difference]: With dead ends: 20 [2022-04-28 03:15:44,075 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:15:44,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2022-04-28 03:15:44,076 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:15:44,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-28 03:15:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:15:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:15:44,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:15:44,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:44,088 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:44,089 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:15:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:44,089 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:15:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:15:44,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:44,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:44,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:15:44,090 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:15:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:15:44,091 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:15:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:15:44,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:15:44,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:15:44,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:15:44,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:15:44,091 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-28 03:15:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:15:44,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:15:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:15:44,092 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:15:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-28 03:15:44,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:15:44,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:15:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:15:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:15:44,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:15:44,109 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:15:44,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:15:44,318 WARN L477 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-28 03:15:44,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:15:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:15:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash 300252983, now seen corresponding path program 2 times [2022-04-28 03:15:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:15:44,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1460323157] [2022-04-28 03:15:46,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:15:46,270 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:15:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash 262445200, now seen corresponding path program 1 times [2022-04-28 03:15:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:15:46,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262053738] [2022-04-28 03:15:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:46,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:15:46,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:15:46,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251074378] [2022-04-28 03:15:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:15:46,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:15:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:15:46,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:15:46,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:15:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:46,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:15:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:15:46,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:17:47,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2022-04-28 03:17:47,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#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); {308#true} is VALID [2022-04-28 03:17:47,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#true} assume true; {308#true} is VALID [2022-04-28 03:17:47,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {308#true} {308#true} #54#return; {308#true} is VALID [2022-04-28 03:17:47,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {308#true} call #t~ret3 := main(); {308#true} is VALID [2022-04-28 03:17:47,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {328#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 03:17:47,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {328#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 03:17:49,755 WARN L290 TraceCheckUtils]: 7: Hoare triple {328#(<= (+ main_~x~0 50) 0)} [60] L29-2-->L29-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_13 v_main_~x~0_12)) (.cse1 (= |v_main_#t~post2_8| |v_main_#t~post2_7|)) (.cse2 (= v_main_~y~0_16 v_main_~y~0_15)) (.cse4 (< v_main_~x~0_13 0)) (.cse5 (* (- 1) v_main_~y~0_15))) (or (and .cse0 .cse1 .cse2) (and (<= 0 v_main_~x~0_13) .cse0 .cse1 .cse2) (let ((.cse3 (div (+ v_main_~y~0_16 .cse5) (- 2)))) (and (= (mod (+ v_main_~y~0_16 v_main_~y~0_15) 2) 0) (= (+ v_main_~x~0_13 (* (* .cse3 .cse3) 2) (* (* v_main_~y~0_16 .cse3) 2)) (+ v_main_~x~0_12 .cse3)) (< 0 .cse3) (forall ((v_itHalf_2 Int)) (or (not (<= 0 v_itHalf_2)) (not (<= (+ v_itHalf_2 1) (div (+ v_main_~y~0_16 (* (- 1) v_main_~y~0_15)) (- 2)))) (< (+ (* 2 (* v_itHalf_2 v_itHalf_2)) v_main_~x~0_13 v_main_~y~0_16 v_itHalf_2 (* (* v_main_~y~0_16 v_itHalf_2) 2)) 0))) .cse4)) (let ((.cse6 (div (+ v_main_~y~0_16 .cse5 1) (- 2)))) (and (forall ((v_itHalf_2 Int)) (or (< (+ (* 2 (* v_itHalf_2 v_itHalf_2)) v_main_~x~0_13 (* (* v_main_~y~0_16 v_itHalf_2) 2)) v_itHalf_2) (not (<= v_itHalf_2 (div (+ v_main_~y~0_16 (* (- 1) v_main_~y~0_15) 1) (- 2)))) (not (<= 1 v_itHalf_2)))) .cse4 (<= 0 .cse6) (= (mod (+ v_main_~y~0_16 v_main_~y~0_15 1) 2) 0) (= v_main_~x~0_12 (+ (* (* .cse6 .cse6) 2) v_main_~x~0_13 v_main_~y~0_16 .cse6 (* (* v_main_~y~0_16 .cse6) 2))))))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post2=|v_main_#t~post2_8|, main_~x~0=v_main_~x~0_13} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post2=|v_main_#t~post2_7|, main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {335#(or (<= (+ main_~x~0 50) 0) (exists ((aux_div_v_main_~y~0_17_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_17_50_77 Int)) (and (<= (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 2) (forall ((v_itHalf_2 Int)) (or (not (<= (+ v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 1) aux_div_aux_mod_v_main_~y~0_17_50_77)) (not (<= 0 v_itHalf_2)) (< (+ (* 2 (* v_itHalf_2 v_itHalf_2)) v_itHalf_2 aux_div_v_main_~y~0_17_50 main_~y~0 main_~x~0 (* (* v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* (* v_itHalf_2 main_~y~0) 2) (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* v_itHalf_2 aux_div_aux_mod_v_main_~y~0_17_50_77) 4) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))))) (< (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) 2)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (<= (+ aux_div_v_main_~y~0_17_50 main_~x~0 (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) 50) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))) (< 0 aux_div_aux_mod_v_main_~y~0_17_50_77))))} is UNKNOWN [2022-04-28 03:17:51,760 WARN L290 TraceCheckUtils]: 8: Hoare triple {335#(or (<= (+ main_~x~0 50) 0) (exists ((aux_div_v_main_~y~0_17_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_17_50_77 Int)) (and (<= (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 2) (forall ((v_itHalf_2 Int)) (or (not (<= (+ v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 1) aux_div_aux_mod_v_main_~y~0_17_50_77)) (not (<= 0 v_itHalf_2)) (< (+ (* 2 (* v_itHalf_2 v_itHalf_2)) v_itHalf_2 aux_div_v_main_~y~0_17_50 main_~y~0 main_~x~0 (* (* v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* (* v_itHalf_2 main_~y~0) 2) (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* v_itHalf_2 aux_div_aux_mod_v_main_~y~0_17_50_77) 4) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))))) (< (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) 2)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (<= (+ aux_div_v_main_~y~0_17_50 main_~x~0 (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) 50) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))) (< 0 aux_div_aux_mod_v_main_~y~0_17_50_77))))} [59] L29-3_primed-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {339#(exists ((main_~x~0 Int)) (and (not (< main_~x~0 0)) (exists ((aux_div_v_main_~y~0_17_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_17_50_77 Int)) (and (<= (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 2) (forall ((v_itHalf_2 Int)) (or (not (<= (+ v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 1) aux_div_aux_mod_v_main_~y~0_17_50_77)) (not (<= 0 v_itHalf_2)) (< (+ (* 2 (* v_itHalf_2 v_itHalf_2)) v_itHalf_2 aux_div_v_main_~y~0_17_50 main_~y~0 main_~x~0 (* (* v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* (* v_itHalf_2 main_~y~0) 2) (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* v_itHalf_2 aux_div_aux_mod_v_main_~y~0_17_50_77) 4) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))))) (< (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) 2)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (<= (+ aux_div_v_main_~y~0_17_50 main_~x~0 (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) 50) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))) (< 0 aux_div_aux_mod_v_main_~y~0_17_50_77)))))} is UNKNOWN [2022-04-28 03:17:51,763 INFO L272 TraceCheckUtils]: 9: Hoare triple {339#(exists ((main_~x~0 Int)) (and (not (< main_~x~0 0)) (exists ((aux_div_v_main_~y~0_17_50 Int) (aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_17_50_77 Int)) (and (<= (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 2) (forall ((v_itHalf_2 Int)) (or (not (<= (+ v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44 1) aux_div_aux_mod_v_main_~y~0_17_50_77)) (not (<= 0 v_itHalf_2)) (< (+ (* 2 (* v_itHalf_2 v_itHalf_2)) v_itHalf_2 aux_div_v_main_~y~0_17_50 main_~y~0 main_~x~0 (* (* v_itHalf_2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* (* v_itHalf_2 main_~y~0) 2) (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* v_itHalf_2 aux_div_aux_mod_v_main_~y~0_17_50_77) 4) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))))) (< (+ (* aux_div_v_main_~y~0_17_50 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (+ (* 2 aux_div_aux_mod_v_main_~y~0_17_50_77) 2)) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44)) (<= (+ aux_div_v_main_~y~0_17_50 main_~x~0 (* 4 (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_v_main_~y~0_17_50_77)) 50) (+ (* (* aux_div_v_main_~y~0_17_50 aux_div_aux_mod_aux_mod_v_main_~y~0_17_50_77_44) 4) (* 2 (* aux_div_v_main_~y~0_17_50 main_~y~0)) (* (* aux_div_v_main_~y~0_17_50 aux_div_v_main_~y~0_17_50) 2))) (< 0 aux_div_aux_mod_v_main_~y~0_17_50_77)))))} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {343#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 03:17:51,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {343#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {347#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 03:17:51,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {309#false} is VALID [2022-04-28 03:17:51,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {309#false} assume !false; {309#false} is VALID [2022-04-28 03:17:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:17:51,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:17:51,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:17:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262053738] [2022-04-28 03:17:51,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:17:51,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251074378] [2022-04-28 03:17:51,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251074378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:17:51,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:17:51,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:20:19,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:20:19,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1460323157] [2022-04-28 03:20:19,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1460323157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:20:19,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:20:19,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:20:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392918258] [2022-04-28 03:20:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:20:19,900 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-28 03:20:19,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:20:19,901 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-28 03:20:25,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 11 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:25,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:20:25,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:25,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:20:25,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=64, Unknown=7, NotChecked=0, Total=90 [2022-04-28 03:20:25,952 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-28 03:20:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:28,453 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:20:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:20:28,453 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-28 03:20:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:20:28,454 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-28 03:20:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-28 03:20:28,455 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-28 03:20:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-28 03:20:28,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-28 03:20:34,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 18 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:34,546 INFO L225 Difference]: With dead ends: 21 [2022-04-28 03:20:34,546 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:20:34,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23, Invalid=80, Unknown=7, NotChecked=0, Total=110 [2022-04-28 03:20:34,547 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:20:34,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-04-28 03:20:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:20:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:20:34,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:20:34,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:34,559 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:34,559 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:34,560 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:20:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:20:34,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:34,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:34,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:20:34,561 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:20:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:20:34,561 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:20:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:20:34,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:20:34,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:20:34,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:20:34,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:20:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:20:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 03:20:34,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 03:20:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:20:34,563 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 03:20:34,563 INFO L496 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-28 03:20:34,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 03:20:38,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 14 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:20:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:20:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:20:38,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:20:38,623 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:20:38,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:20:38,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 03:20:38,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:20:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:20:38,824 INFO L85 PathProgramCache]: Analyzing trace with hash 752402959, now seen corresponding path program 3 times [2022-04-28 03:20:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:20:38,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833641935] [2022-04-28 03:20:40,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:20:40,180 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:20:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash 321550544, now seen corresponding path program 1 times [2022-04-28 03:20:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:20:40,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84576982] [2022-04-28 03:20:40,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:20:40,192 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:20:40,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811759976] [2022-04-28 03:20:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:20:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:20:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:20:40,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:20:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:20:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:40,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:20:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:20:40,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:22:09,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-28 03:22:09,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#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); {464#true} is VALID [2022-04-28 03:22:09,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#true} assume true; {464#true} is VALID [2022-04-28 03:22:09,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {464#true} {464#true} #54#return; {464#true} is VALID [2022-04-28 03:22:09,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {464#true} call #t~ret3 := main(); {464#true} is VALID [2022-04-28 03:22:09,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {484#(= main_~x~0 (- 50))} is VALID [2022-04-28 03:22:09,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(= main_~x~0 (- 50))} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {484#(= main_~x~0 (- 50))} is VALID [2022-04-28 03:22:11,219 WARN L290 TraceCheckUtils]: 7: Hoare triple {484#(= main_~x~0 (- 50))} [62] L29-2-->L29-3_primed: Formula: (let ((.cse1 (< v_main_~x~0_19 0)) (.cse2 (* (- 1) v_main_~y~0_21)) (.cse3 (= v_main_~x~0_19 v_main_~x~0_18)) (.cse4 (= v_main_~y~0_22 v_main_~y~0_21)) (.cse5 (= |v_main_#t~post2_13| |v_main_#t~post2_12|))) (or (let ((.cse0 (div (+ v_main_~y~0_22 .cse2 1) (- 2)))) (and (= v_main_~x~0_18 (+ (* (* v_main_~y~0_22 .cse0) 2) v_main_~x~0_19 v_main_~y~0_22 (* 2 (* .cse0 .cse0)) .cse0)) .cse1 (forall ((v_itHalf_3 Int)) (or (not (<= 1 v_itHalf_3)) (< (+ (* 2 (* v_main_~y~0_22 v_itHalf_3)) v_main_~x~0_19 (* 2 (* v_itHalf_3 v_itHalf_3))) v_itHalf_3) (not (<= v_itHalf_3 (div (+ v_main_~y~0_22 (* (- 1) v_main_~y~0_21) 1) (- 2)))))) (<= 0 .cse0) (= (mod (+ v_main_~y~0_22 v_main_~y~0_21 1) 2) 0))) (and .cse3 .cse4 .cse5) (let ((.cse6 (div (+ v_main_~y~0_22 .cse2) (- 2)))) (and .cse1 (forall ((v_itHalf_3 Int)) (or (not (<= (+ v_itHalf_3 1) (div (+ v_main_~y~0_22 (* (- 1) v_main_~y~0_21)) (- 2)))) (not (<= 0 v_itHalf_3)) (< (+ (* 2 (* v_main_~y~0_22 v_itHalf_3)) v_main_~x~0_19 v_main_~y~0_22 v_itHalf_3 (* 2 (* v_itHalf_3 v_itHalf_3))) 0))) (< 0 .cse6) (= (mod (+ v_main_~y~0_22 v_main_~y~0_21) 2) 0) (= (+ v_main_~x~0_18 .cse6) (+ v_main_~x~0_19 (* 2 (* .cse6 .cse6)) (* (* v_main_~y~0_22 .cse6) 2))))) (and .cse3 .cse4 (<= 0 v_main_~x~0_19) .cse5))) InVars {main_~y~0=v_main_~y~0_22, main_#t~post2=|v_main_#t~post2_13|, main_~x~0=v_main_~x~0_19} OutVars{main_~y~0=v_main_~y~0_21, main_#t~post2=|v_main_#t~post2_12|, main_~x~0=v_main_~x~0_18} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {491#(or (exists ((aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_23_50_77 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= (+ v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 1) aux_div_aux_mod_v_main_~y~0_23_50_77)) (< (+ v_itHalf_3 (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 main_~y~0) 2) main_~y~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) (* (* v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4)) (+ (* (* v_itHalf_3 aux_div_aux_mod_v_main_~y~0_23_50_77) 4) (* aux_div_aux_mod_v_main_~y~0_23_50_77 2) 50)) (not (<= 0 v_itHalf_3)))) (< aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 aux_div_aux_mod_v_main_~y~0_23_50_77) (= (+ (* 2 (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_v_main_~y~0_23_50_77)) aux_div_aux_mod_v_main_~y~0_23_50_77 main_~x~0 50) (+ (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4) (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 main_~y~0) 2))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 2) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44)))) (= main_~x~0 (- 50)) (exists ((aux_div_v_main_~y~0_23_38 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= 1 v_itHalf_3)) (< (+ (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 aux_div_v_main_~y~0_23_38) 4)) (+ (* (* v_itHalf_3 main_~y~0) 2) (* v_itHalf_3 3) 50)) (not (<= (+ v_itHalf_3 aux_div_v_main_~y~0_23_38) main_~y~0)))) (= (+ (* 2 (* (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)) (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)))) (* aux_div_v_main_~y~0_23_38 2) (* (* aux_div_v_main_~y~0_23_38 (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2))) 4)) (+ 51 (* (* (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)) main_~y~0) 2) (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)) main_~y~0 main_~x~0)) (<= aux_div_v_main_~y~0_23_38 main_~y~0))))} is UNKNOWN [2022-04-28 03:22:13,225 WARN L290 TraceCheckUtils]: 8: Hoare triple {491#(or (exists ((aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_23_50_77 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= (+ v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 1) aux_div_aux_mod_v_main_~y~0_23_50_77)) (< (+ v_itHalf_3 (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 main_~y~0) 2) main_~y~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) (* (* v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4)) (+ (* (* v_itHalf_3 aux_div_aux_mod_v_main_~y~0_23_50_77) 4) (* aux_div_aux_mod_v_main_~y~0_23_50_77 2) 50)) (not (<= 0 v_itHalf_3)))) (< aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 aux_div_aux_mod_v_main_~y~0_23_50_77) (= (+ (* 2 (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_v_main_~y~0_23_50_77)) aux_div_aux_mod_v_main_~y~0_23_50_77 main_~x~0 50) (+ (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4) (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 main_~y~0) 2))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 2) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44)))) (= main_~x~0 (- 50)) (exists ((aux_div_v_main_~y~0_23_38 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= 1 v_itHalf_3)) (< (+ (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 aux_div_v_main_~y~0_23_38) 4)) (+ (* (* v_itHalf_3 main_~y~0) 2) (* v_itHalf_3 3) 50)) (not (<= (+ v_itHalf_3 aux_div_v_main_~y~0_23_38) main_~y~0)))) (= (+ (* 2 (* (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)) (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)))) (* aux_div_v_main_~y~0_23_38 2) (* (* aux_div_v_main_~y~0_23_38 (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2))) 4)) (+ 51 (* (* (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)) main_~y~0) 2) (div (+ (* aux_div_v_main_~y~0_23_38 2) (* (- 2) main_~y~0)) (- 2)) main_~y~0 main_~x~0)) (<= aux_div_v_main_~y~0_23_38 main_~y~0))))} [61] L29-3_primed-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {495#(or (exists ((aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_23_50_77 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= (+ v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 1) aux_div_aux_mod_v_main_~y~0_23_50_77)) (< (+ v_itHalf_3 (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 main_~y~0) 2) main_~y~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) (* (* v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4)) (+ (* (* v_itHalf_3 aux_div_aux_mod_v_main_~y~0_23_50_77) 4) (* aux_div_aux_mod_v_main_~y~0_23_50_77 2) 50)) (not (<= 0 v_itHalf_3)))) (< aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 aux_div_aux_mod_v_main_~y~0_23_50_77) (not (< (+ (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4) (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 main_~y~0) 2)) (+ (* 2 (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_v_main_~y~0_23_50_77)) aux_div_aux_mod_v_main_~y~0_23_50_77 50))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 2) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44)))) (exists ((aux_div_v_main_~y~0_23_38 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= 1 v_itHalf_3)) (< (+ (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 aux_div_v_main_~y~0_23_38) 4)) (+ (* (* v_itHalf_3 main_~y~0) 2) (* v_itHalf_3 3) 50)) (not (<= (+ v_itHalf_3 aux_div_v_main_~y~0_23_38) main_~y~0)))) (not (< (+ (* aux_div_v_main_~y~0_23_38 3) (* 2 (* aux_div_v_main_~y~0_23_38 main_~y~0))) (+ 51 (* main_~y~0 2) (* (* aux_div_v_main_~y~0_23_38 aux_div_v_main_~y~0_23_38) 2)))) (<= aux_div_v_main_~y~0_23_38 main_~y~0))))} is UNKNOWN [2022-04-28 03:22:13,230 INFO L272 TraceCheckUtils]: 9: Hoare triple {495#(or (exists ((aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 Int) (aux_div_aux_mod_v_main_~y~0_23_50_77 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= (+ v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 1) aux_div_aux_mod_v_main_~y~0_23_50_77)) (< (+ v_itHalf_3 (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 main_~y~0) 2) main_~y~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) (* (* v_itHalf_3 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4)) (+ (* (* v_itHalf_3 aux_div_aux_mod_v_main_~y~0_23_50_77) 4) (* aux_div_aux_mod_v_main_~y~0_23_50_77 2) 50)) (not (<= 0 v_itHalf_3)))) (< aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44 aux_div_aux_mod_v_main_~y~0_23_50_77) (not (< (+ (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 4) (* (* aux_div_aux_mod_v_main_~y~0_23_50_77 main_~y~0) 2)) (+ (* 2 (* aux_div_aux_mod_v_main_~y~0_23_50_77 aux_div_aux_mod_v_main_~y~0_23_50_77)) aux_div_aux_mod_v_main_~y~0_23_50_77 50))) (< (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44) 2) (<= 0 (* 2 aux_div_aux_mod_aux_mod_v_main_~y~0_23_50_77_44)))) (exists ((aux_div_v_main_~y~0_23_38 Int)) (and (forall ((v_itHalf_3 Int)) (or (not (<= 1 v_itHalf_3)) (< (+ (* 2 (* v_itHalf_3 v_itHalf_3)) (* (* v_itHalf_3 aux_div_v_main_~y~0_23_38) 4)) (+ (* (* v_itHalf_3 main_~y~0) 2) (* v_itHalf_3 3) 50)) (not (<= (+ v_itHalf_3 aux_div_v_main_~y~0_23_38) main_~y~0)))) (not (< (+ (* aux_div_v_main_~y~0_23_38 3) (* 2 (* aux_div_v_main_~y~0_23_38 main_~y~0))) (+ 51 (* main_~y~0 2) (* (* aux_div_v_main_~y~0_23_38 aux_div_v_main_~y~0_23_38) 2)))) (<= aux_div_v_main_~y~0_23_38 main_~y~0))))} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {499#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 03:22:13,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {503#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 03:22:13,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {465#false} is VALID [2022-04-28 03:22:13,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-28 03:22:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:22:13,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:22:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:22:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84576982] [2022-04-28 03:22:13,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:22:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811759976] [2022-04-28 03:22:13,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811759976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:22:13,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:22:13,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:24:28,361 WARN L232 SmtUtils]: Spent 5.42s on a formula simplification. DAG size of input: 97 DAG size of output: 94 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:24:40,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:24:40,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833641935] [2022-04-28 03:24:40,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833641935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:24:40,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:24:40,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:24:40,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791786932] [2022-04-28 03:24:40,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:24:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 15 [2022-04-28 03:24:40,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:24:40,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-28 03:24:48,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 11 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:48,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:24:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:24:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:24:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=75, Unknown=14, NotChecked=0, Total=110 [2022-04-28 03:24:48,852 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-28 03:24:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:49,077 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:24:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:24:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 15 [2022-04-28 03:24:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:24:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-28 03:24:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-28 03:24:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-28 03:24:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-04-28 03:24:49,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 22 transitions. [2022-04-28 03:24:55,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:24:55,170 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:24:55,170 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:24:55,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 46.2s TimeCoverageRelationStatistics Valid=25, Invalid=93, Unknown=14, NotChecked=0, Total=132 [2022-04-28 03:24:55,171 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:24:55,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 34 Unchecked, 0.0s Time] [2022-04-28 03:24:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:24:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:24:55,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:24:55,207 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-28 03:24:55,207 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-28 03:24:55,208 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-28 03:24:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:55,209 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:24:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:24:55,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:55,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:55,209 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-28 03:24:55,209 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-28 03:24:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:24:55,210 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:24:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:24:55,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:24:55,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:24:55,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:24:55,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:24:55,211 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-28 03:24:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 03:24:55,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 03:24:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:24:55,211 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 03:24:55,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-28 03:24:55,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 03:24:59,819 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-28 03:24:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:24:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:24:59,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:24:59,820 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:24:59,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 03:25:00,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:25:00,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:25:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:25:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1884150327, now seen corresponding path program 4 times [2022-04-28 03:25:00,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:25:00,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1596066259] [2022-04-28 03:25:00,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:25:00,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:25:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash 380655888, now seen corresponding path program 1 times [2022-04-28 03:25:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:25:00,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034885215] [2022-04-28 03:25:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:25:00,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 03:25:00,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127618534] [2022-04-28 03:25:00,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:25:00,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:25:00,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:25:00,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:25:00,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:25:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:00,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:25:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:25:00,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:27:01,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2022-04-28 03:27:01,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#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); {627#true} is VALID [2022-04-28 03:27:01,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2022-04-28 03:27:01,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #54#return; {627#true} is VALID [2022-04-28 03:27:01,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret3 := main(); {627#true} is VALID [2022-04-28 03:27:01,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {627#true} havoc ~x~0;havoc ~y~0;~x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; {647#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 03:27:01,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {647#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {647#(<= (+ main_~x~0 50) 0)} is VALID [2022-04-28 03:27:03,129 WARN L290 TraceCheckUtils]: 7: Hoare triple {647#(<= (+ main_~x~0 50) 0)} [64] L29-2-->L29-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_17| |v_main_#t~post2_16|)) (.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_29 v_main_~y~0_28)) (.cse3 (< v_main_~x~0_26 0))) (or (and .cse0 .cse1 (<= 0 v_main_~x~0_26) .cse2) (let ((.cse4 (div (+ v_main_~y~0_29 (* (- 1) v_main_~y~0_28)) (- 2)))) (and .cse3 (forall ((v_itHalf_4 Int)) (or (not (<= (+ v_itHalf_4 1) (div (+ v_main_~y~0_29 (* (- 1) v_main_~y~0_28)) (- 2)))) (< (+ v_main_~x~0_26 v_main_~y~0_29 v_itHalf_4 (* (* v_main_~y~0_29 v_itHalf_4) 2) (* (* v_itHalf_4 v_itHalf_4) 2)) 0) (not (<= 0 v_itHalf_4)))) (= (mod (+ v_main_~y~0_29 v_main_~y~0_28) 2) 0) (= (+ (* 2 (* .cse4 .cse4)) v_main_~x~0_26 (* 2 (* v_main_~y~0_29 .cse4))) (+ v_main_~x~0_25 .cse4)) (< 0 .cse4))) (and .cse0 .cse1 .cse2) (let ((.cse5 (div (+ (- 1) v_main_~y~0_28 (* (- 1) v_main_~y~0_29)) 2))) (and (<= 0 .cse5) .cse3 (= (mod (+ v_main_~y~0_29 v_main_~y~0_28 1) 2) 0) (forall ((v_itHalf_4 Int)) (or (not (<= v_itHalf_4 (div (+ (- 1) v_main_~y~0_28 (* (- 1) v_main_~y~0_29)) 2))) (not (<= 1 v_itHalf_4)) (< (+ v_main_~x~0_26 (* (* v_main_~y~0_29 v_itHalf_4) 2) (* (* v_itHalf_4 v_itHalf_4) 2)) v_itHalf_4))) (= (+ v_main_~x~0_26 v_main_~y~0_29 (* 2 (* v_main_~y~0_29 .cse5)) (* 2 (* .cse5 .cse5)) .cse5) v_main_~x~0_25))))) InVars {main_~y~0=v_main_~y~0_29, main_#t~post2=|v_main_#t~post2_17|, main_~x~0=v_main_~x~0_26} OutVars{main_~y~0=v_main_~y~0_28, main_#t~post2=|v_main_#t~post2_16|, main_~x~0=v_main_~x~0_25} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post2] {654#(or (exists ((aux_div_v_main_~y~0_30_36 Int)) (and (< aux_div_v_main_~y~0_30_36 main_~y~0) (<= (+ (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~y~0 main_~x~0 50) (+ aux_div_v_main_~y~0_30_36 (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (forall ((v_itHalf_4 Int)) (or (not (<= (+ v_itHalf_4 aux_div_v_main_~y~0_30_36 1) main_~y~0)) (< (+ (* (* v_itHalf_4 aux_div_v_main_~y~0_30_36) 4) v_itHalf_4 aux_div_v_main_~y~0_30_36 (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~x~0 (* (* v_itHalf_4 v_itHalf_4) 2)) (+ (* (* v_itHalf_4 main_~y~0) 2) (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (not (<= 0 v_itHalf_4)))))) (<= (+ main_~x~0 50) 0))} is UNKNOWN [2022-04-28 03:27:03,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(or (exists ((aux_div_v_main_~y~0_30_36 Int)) (and (< aux_div_v_main_~y~0_30_36 main_~y~0) (<= (+ (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~y~0 main_~x~0 50) (+ aux_div_v_main_~y~0_30_36 (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (forall ((v_itHalf_4 Int)) (or (not (<= (+ v_itHalf_4 aux_div_v_main_~y~0_30_36 1) main_~y~0)) (< (+ (* (* v_itHalf_4 aux_div_v_main_~y~0_30_36) 4) v_itHalf_4 aux_div_v_main_~y~0_30_36 (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~x~0 (* (* v_itHalf_4 v_itHalf_4) 2)) (+ (* (* v_itHalf_4 main_~y~0) 2) (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (not (<= 0 v_itHalf_4)))))) (<= (+ main_~x~0 50) 0))} [63] L29-3_primed-->L29-3: Formula: (not (< v_main_~x~0_1 0)) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {658#(exists ((main_~x~0 Int)) (and (not (< main_~x~0 0)) (exists ((aux_div_v_main_~y~0_30_36 Int)) (and (< aux_div_v_main_~y~0_30_36 main_~y~0) (<= (+ (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~y~0 main_~x~0 50) (+ aux_div_v_main_~y~0_30_36 (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (forall ((v_itHalf_4 Int)) (or (not (<= (+ v_itHalf_4 aux_div_v_main_~y~0_30_36 1) main_~y~0)) (< (+ (* (* v_itHalf_4 aux_div_v_main_~y~0_30_36) 4) v_itHalf_4 aux_div_v_main_~y~0_30_36 (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~x~0 (* (* v_itHalf_4 v_itHalf_4) 2)) (+ (* (* v_itHalf_4 main_~y~0) 2) (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (not (<= 0 v_itHalf_4))))))))} is VALID [2022-04-28 03:27:03,147 INFO L272 TraceCheckUtils]: 9: Hoare triple {658#(exists ((main_~x~0 Int)) (and (not (< main_~x~0 0)) (exists ((aux_div_v_main_~y~0_30_36 Int)) (and (< aux_div_v_main_~y~0_30_36 main_~y~0) (<= (+ (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~y~0 main_~x~0 50) (+ aux_div_v_main_~y~0_30_36 (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (forall ((v_itHalf_4 Int)) (or (not (<= (+ v_itHalf_4 aux_div_v_main_~y~0_30_36 1) main_~y~0)) (< (+ (* (* v_itHalf_4 aux_div_v_main_~y~0_30_36) 4) v_itHalf_4 aux_div_v_main_~y~0_30_36 (* (* aux_div_v_main_~y~0_30_36 aux_div_v_main_~y~0_30_36) 2) main_~x~0 (* (* v_itHalf_4 v_itHalf_4) 2)) (+ (* (* v_itHalf_4 main_~y~0) 2) (* 2 (* aux_div_v_main_~y~0_30_36 main_~y~0)))) (not (<= 0 v_itHalf_4))))))))} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {662#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:27:03,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {662#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {666#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:27:03,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {628#false} is VALID [2022-04-28 03:27:03,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#false} assume !false; {628#false} is VALID [2022-04-28 03:27:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:27:03,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 03:27:03,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:27:03,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034885215] [2022-04-28 03:27:03,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 03:27:03,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127618534] [2022-04-28 03:27:03,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127618534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:27:03,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:27:03,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7