/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/nla-digbench-scaling/ps6-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:58:22,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:58:22,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:58:22,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:58:22,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:58:22,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:58:22,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:58:22,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:58:22,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:58:22,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:58:22,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:58:22,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:58:22,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:58:22,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:58:22,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:58:22,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:58:22,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:58:22,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:58:22,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:58:22,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:58:22,642 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:58:22,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:58:22,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:58:22,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:58:22,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:58:22,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:58:22,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:58:22,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:58:22,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:58:22,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:58:22,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:58:22,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:58:22,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:58:22,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:58:22,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:58:22,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:58:22,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:58:22,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:58:22,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:58:22,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:58:22,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:58:22,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:58:22,652 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 07:58:22,658 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:58:22,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:58:22,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:58:22,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:58:22,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:58:22,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:58:22,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:58:22,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:58:22,664 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:58:22,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:58:22,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:22,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:58:22,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:58:22,664 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:58:22,665 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:58:22,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:58:22,665 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:58:22,665 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 07:58:22,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:58:22,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:58:22,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:58:22,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:58:22,884 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:58:22,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound2.c [2022-04-28 07:58:22,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc7ed049/650cfb3a8d8143679908aea4ef36c2f7/FLAGb44eab932 [2022-04-28 07:58:23,286 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:58:23,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound2.c [2022-04-28 07:58:23,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc7ed049/650cfb3a8d8143679908aea4ef36c2f7/FLAGb44eab932 [2022-04-28 07:58:23,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc7ed049/650cfb3a8d8143679908aea4ef36c2f7 [2022-04-28 07:58:23,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:58:23,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:58:23,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:23,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:58:23,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:58:23,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac555d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23, skipping insertion in model container [2022-04-28 07:58:23,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:58:23,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:58:23,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound2.c[458,471] [2022-04-28 07:58:23,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:23,483 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:58:23,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound2.c[458,471] [2022-04-28 07:58:23,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:58:23,512 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:58:23,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23 WrapperNode [2022-04-28 07:58:23,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:58:23,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:58:23,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:58:23,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:58:23,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:58:23,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:58:23,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:58:23,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:58:23,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (1/1) ... [2022-04-28 07:58:23,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:58:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:23,562 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 07:58:23,583 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 07:58:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:58:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:58:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:58:23,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:58:23,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:58:23,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:58:23,600 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:58:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:58:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:58:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:58:23,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-28 07:58:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:58:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:58:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:58:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:58:23,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:58:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:58:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:58:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:58:23,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:58:23,647 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:58:23,649 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:58:23,779 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:58:23,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:58:23,784 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:58:23,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:23 BoogieIcfgContainer [2022-04-28 07:58:23,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:58:23,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:58:23,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:58:23,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:58:23,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:58:23" (1/3) ... [2022-04-28 07:58:23,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10540042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:23, skipping insertion in model container [2022-04-28 07:58:23,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:58:23" (2/3) ... [2022-04-28 07:58:23,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10540042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:58:23, skipping insertion in model container [2022-04-28 07:58:23,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:58:23" (3/3) ... [2022-04-28 07:58:23,791 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound2.c [2022-04-28 07:58:23,801 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:58:23,802 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:58:23,843 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:58:23,848 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@105ebbd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45736949 [2022-04-28 07:58:23,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:58:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:23,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:23,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:23,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:23,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:23,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-28 07:58:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:23,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1168934580] [2022-04-28 07:58:23,879 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-28 07:58:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:23,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519639808] [2022-04-28 07:58:23,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:58:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:24,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 07:58:24,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:24,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:58:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:24,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:24,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:24,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:24,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 07:58:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:24,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:24,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:24,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:24,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:24,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:58:24,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 07:58:24,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 07:58:24,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-28 07:58:24,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 07:58:24,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-28 07:58:24,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:24,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:24,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:24,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:24,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 07:58:24,089 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-28 07:58:24,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 07:58:24,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 07:58:24,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 07:58:24,090 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 07:58:24,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-28 07:58:24,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 07:58:24,090 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-28 07:58:24,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 07:58:24,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 07:58:24,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 07:58:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:24,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519639808] [2022-04-28 07:58:24,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519639808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:24,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:24,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:24,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:24,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1168934580] [2022-04-28 07:58:24,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1168934580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:24,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:24,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:58:24,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086138750] [2022-04-28 07:58:24,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:24,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:24,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:24,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:24,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:24,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:58:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:58:24,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:24,171 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:24,577 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-28 07:58:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:58:24,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 07:58:24,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-28 07:58:24,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-28 07:58:24,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:24,702 INFO L225 Difference]: With dead ends: 51 [2022-04-28 07:58:24,702 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 07:58:24,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:58:24,707 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:24,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 07:58:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 07:58:24,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:24,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:24,750 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:24,751 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:24,754 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:24,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:24,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:24,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:24,756 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-28 07:58:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:24,759 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 07:58:24,759 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:24,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:24,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:24,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:24,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 07:58:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-28 07:58:24,774 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-28 07:58:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:24,775 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-28 07:58:24,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 07:58:24,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-28 07:58:24,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 07:58:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 07:58:24,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:24,816 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:24,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:58:24,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:24,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-28 07:58:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:24,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591053321] [2022-04-28 07:58:24,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:24,818 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-28 07:58:24,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:24,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531050847] [2022-04-28 07:58:24,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:24,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:24,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:24,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594470878] [2022-04-28 07:58:24,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:24,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:24,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:24,838 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 07:58:24,849 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 07:58:24,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:58:24,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:24,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 07:58:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:24,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:25,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 07:58:25,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-28 07:58:25,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:25,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-28 07:58:25,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-28 07:58:25,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-28 07:58:25,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:25,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:25,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:25,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:25,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 07:58:25,102 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-28 07:58:25,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 07:58:25,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 07:58:25,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 07:58:25,106 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 07:58:25,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,109 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:25,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:25,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 07:58:25,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 07:58:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:25,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:58:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:25,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531050847] [2022-04-28 07:58:25,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:25,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594470878] [2022-04-28 07:58:25,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594470878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:25,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:25,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:25,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:25,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591053321] [2022-04-28 07:58:25,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591053321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:25,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:25,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316263225] [2022-04-28 07:58:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:25,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:25,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:25,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:25,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:25,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:25,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:25,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:58:25,137 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:25,301 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 07:58:25,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 07:58:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 07:58:25,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 07:58:25,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:25,349 INFO L225 Difference]: With dead ends: 35 [2022-04-28 07:58:25,349 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 07:58:25,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 07:58:25,352 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:25,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 07:58:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 07:58:25,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:25,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:25,366 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:25,366 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:25,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:25,368 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:25,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:25,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:25,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 07:58:25,369 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-28 07:58:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:25,372 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 07:58:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:25,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:25,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:25,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:25,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 07:58:25,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-28 07:58:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:25,374 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 07:58:25,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 07:58:25,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 07:58:25,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 07:58:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 07:58:25,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:25,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:25,428 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 07:58:25,621 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 07:58:25,621 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:25,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-28 07:58:25,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:25,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12264391] [2022-04-28 07:58:25,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-28 07:58:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:25,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593496012] [2022-04-28 07:58:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:25,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:25,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631287436] [2022-04-28 07:58:25,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:25,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:25,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:25,636 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 07:58:25,637 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 07:58:25,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:25,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:25,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:58:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:25,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:25,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:58:25,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-28 07:58:25,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:25,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:58:25,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:58:25,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-28 07:58:25,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:25,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:25,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:25,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:25,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:58:25,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:25,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:25,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:25,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:25,859 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:58:25,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,860 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:25,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:25,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:25,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:25,861 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:25,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:58:25,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-28 07:58:25,864 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:25,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:25,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:58:25,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:58:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 07:58:25,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:26,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-28 07:58:26,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-28 07:58:26,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:26,069 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:26,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:26,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:26,152 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:26,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:26,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:26,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:26,152 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:26,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:26,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-28 07:58:26,154 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-28 07:58:26,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:26,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:26,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:26,154 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:26,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-28 07:58:26,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:26,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-28 07:58:26,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-28 07:58:26,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {512#true} is VALID [2022-04-28 07:58:26,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-28 07:58:26,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-28 07:58:26,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-28 07:58:26,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-28 07:58:26,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-28 07:58:26,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-28 07:58:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:58:26,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:26,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593496012] [2022-04-28 07:58:26,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:26,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631287436] [2022-04-28 07:58:26,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631287436] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:26,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:26,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 07:58:26,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:26,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12264391] [2022-04-28 07:58:26,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12264391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:26,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:26,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:58:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831528570] [2022-04-28 07:58:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:58:26,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:26,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:26,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:58:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:58:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 07:58:26,260 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:26,373 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 07:58:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:58:26,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-28 07:58:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:58:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-28 07:58:26,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-28 07:58:26,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:26,485 INFO L225 Difference]: With dead ends: 37 [2022-04-28 07:58:26,485 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 07:58:26,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 07:58:26,486 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:26,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 07:58:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 07:58:26,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:26,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:26,505 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:26,505 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:26,506 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:58:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:26,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:26,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:26,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 07:58:26,507 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 07:58:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:26,509 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 07:58:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:26,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:26,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:26,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:26,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:58:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 07:58:26,510 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-28 07:58:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:26,511 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 07:58:26,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:58:26,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 07:58:26,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 07:58:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 07:58:26,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:26,593 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:26,609 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 07:58:26,793 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 07:58:26,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:26,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-28 07:58:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:26,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220834941] [2022-04-28 07:58:26,795 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-28 07:58:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:26,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273751111] [2022-04-28 07:58:26,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:26,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:26,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:26,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246519421] [2022-04-28 07:58:26,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:58:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:26,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:26,812 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 07:58:26,813 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 07:58:26,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:58:26,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:26,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 07:58:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:26,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:27,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-28 07:58:27,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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);call #Ultimate.allocInit(12, 3); {900#true} is VALID [2022-04-28 07:58:27,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:27,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-28 07:58:27,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-28 07:58:27,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {900#true} is VALID [2022-04-28 07:58:27,163 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:27,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:27,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:27,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:27,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-28 07:58:27,164 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:27,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:27,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:27,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:27,164 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-28 07:58:27,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:27,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:27,169 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:27,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:27,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:27,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:27,170 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:27,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:27,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:27,171 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:27,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:27,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:27,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:27,172 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-28 07:58:27,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:27,172 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-28 07:58:27,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-28 07:58:27,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-28 07:58:27,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-28 07:58:27,173 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-28 07:58:27,174 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:27,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:27,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-28 07:58:27,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-28 07:58:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:58:27,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273751111] [2022-04-28 07:58:27,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:27,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246519421] [2022-04-28 07:58:27,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246519421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:27,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:27,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 07:58:27,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220834941] [2022-04-28 07:58:27,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220834941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:27,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:27,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 07:58:27,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556868092] [2022-04-28 07:58:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:27,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:58:27,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:27,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:27,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:27,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 07:58:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:27,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 07:58:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 07:58:27,493 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:27,711 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 07:58:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 07:58:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-28 07:58:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:58:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-28 07:58:27,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-28 07:58:27,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:27,752 INFO L225 Difference]: With dead ends: 42 [2022-04-28 07:58:27,752 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 07:58:27,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:58:27,755 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:27,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:27,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 07:58:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 07:58:27,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:27,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:27,781 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:27,783 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:27,786 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:58:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:27,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:27,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:27,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:58:27,792 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-28 07:58:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:27,797 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 07:58:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:27,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:27,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:27,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:27,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:58:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-28 07:58:27,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-28 07:58:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:27,800 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-28 07:58:27,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 07:58:27,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-28 07:58:27,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-28 07:58:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 07:58:27,885 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:27,886 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:27,902 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 07:58:28,086 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 07:58:28,086 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-28 07:58:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:28,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985946577] [2022-04-28 07:58:28,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-28 07:58:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:28,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736918352] [2022-04-28 07:58:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:28,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:28,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321156185] [2022-04-28 07:58:28,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 07:58:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:28,101 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 07:58:28,102 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 07:58:28,132 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 07:58:28,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:28,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:58:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:28,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-28 07:58:28,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-28 07:58:28,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,426 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-28 07:58:28,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:28,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:28,428 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:28,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:28,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:28,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,439 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-28 07:58:28,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:28,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:28,440 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:28,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:28,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:28,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,441 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (= main_~c~0 1))} is VALID [2022-04-28 07:58:28,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:28,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !false; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:28,442 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:28,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:28,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:28,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,442 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} #57#return; {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} is VALID [2022-04-28 07:58:28,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:28,443 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-28 07:58:28,443 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-28 07:58:28,443 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-28 07:58:28,443 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 07:58:28,444 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} #59#return; {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:28,445 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (< 1 main_~k~0) (= (+ (- 1) main_~y~0) 1) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:58:28,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:58:28,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-28 07:58:28,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-28 07:58:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 07:58:28,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:28,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:28,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736918352] [2022-04-28 07:58:28,723 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:28,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321156185] [2022-04-28 07:58:28,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321156185] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 07:58:28,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:58:28,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 07:58:28,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:28,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985946577] [2022-04-28 07:58:28,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985946577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:28,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:28,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174230172] [2022-04-28 07:58:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:28,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:58:28,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:28,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:28,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:58:28,751 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:29,013 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-28 07:58:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 07:58:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-28 07:58:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:58:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 07:58:29,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 07:58:29,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:29,051 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:58:29,051 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 07:58:29,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:58:29,053 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:29,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 166 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:58:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 07:58:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 07:58:29,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:29,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:29,074 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:29,075 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:29,076 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:58:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:29,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:29,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:29,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:58:29,076 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-28 07:58:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:29,078 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 07:58:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:29,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:29,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:29,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:29,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:58:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-28 07:58:29,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-28 07:58:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:29,080 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-28 07:58:29,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 07:58:29,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-28 07:58:29,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 07:58:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 07:58:29,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:58:29,236 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:58:29,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:29,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:29,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:58:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:58:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-28 07:58:29,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:29,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519025267] [2022-04-28 07:58:29,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:58:29,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-28 07:58:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:58:29,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526227764] [2022-04-28 07:58:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:58:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:58:29,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:58:29,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629608736] [2022-04-28 07:58:29,458 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 07:58:29,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:29,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:58:29,459 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:58:29,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 07:58:29,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 07:58:29,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:58:29,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 07:58:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:58:29,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:58:29,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-28 07:58:29,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#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);call #Ultimate.allocInit(12, 3); {1770#true} is VALID [2022-04-28 07:58:29,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:29,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-28 07:58:29,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-28 07:58:29,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1770#true} is VALID [2022-04-28 07:58:29,788 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:29,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {1796#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:58:29,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1796#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1800#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:29,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {1800#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1800#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:29,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1800#(not (= |assume_abort_if_not_#in~cond| 0))} {1770#true} #53#return; {1807#(and (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:29,789 INFO L272 TraceCheckUtils]: 11: Hoare triple {1807#(and (<= 0 main_~k~0) (<= main_~k~0 2))} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:29,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:29,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:29,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:29,789 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {1807#(and (<= 0 main_~k~0) (<= main_~k~0 2))} #55#return; {1807#(and (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:29,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {1807#(and (<= 0 main_~k~0) (<= main_~k~0 2))} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} is VALID [2022-04-28 07:58:29,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} assume !false; {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} is VALID [2022-04-28 07:58:29,790 INFO L272 TraceCheckUtils]: 18: Hoare triple {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:29,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:29,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:29,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:29,791 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} #57#return; {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} is VALID [2022-04-28 07:58:29,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {1826#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 0 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:29,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} assume !false; {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:29,792 INFO L272 TraceCheckUtils]: 25: Hoare triple {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:29,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:29,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:29,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:29,792 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} #57#return; {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-28 07:58:29,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {1848#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-28 07:58:29,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} assume !false; {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-28 07:58:29,794 INFO L272 TraceCheckUtils]: 32: Hoare triple {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:29,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:29,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:29,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:29,794 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} #57#return; {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {1870#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L272 TraceCheckUtils]: 39: Hoare triple {1771#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {1771#false} ~cond := #in~cond; {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {1771#false} assume !(0 == ~cond); {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {1771#false} assume true; {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1771#false} {1771#false} #57#return; {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {1771#false} assume !(~c~0 < ~k~0); {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L272 TraceCheckUtils]: 45: Hoare triple {1771#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {1771#false} ~cond := #in~cond; {1771#false} is VALID [2022-04-28 07:58:29,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {1771#false} assume !(0 == ~cond); {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {1771#false} assume true; {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1771#false} {1771#false} #59#return; {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L272 TraceCheckUtils]: 50: Hoare triple {1771#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {1771#false} ~cond := #in~cond; {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {1771#false} assume 0 == ~cond; {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-28 07:58:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 07:58:29,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:58:30,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {1771#false} assume 0 == ~cond; {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {1771#false} ~cond := #in~cond; {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L272 TraceCheckUtils]: 50: Hoare triple {1771#false} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1770#true} {1771#false} #59#return; {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 48: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 47: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:30,039 INFO L272 TraceCheckUtils]: 45: Hoare triple {1771#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {1771#false} assume !(~c~0 < ~k~0); {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1770#true} {1771#false} #57#return; {1771#false} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:30,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:30,040 INFO L272 TraceCheckUtils]: 39: Hoare triple {1771#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {1771#false} assume !false; {1771#false} is VALID [2022-04-28 07:58:30,041 INFO L290 TraceCheckUtils]: 37: Hoare triple {1988#(not (< main_~c~0 main_~k~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1771#false} is VALID [2022-04-28 07:58:30,042 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1770#true} {1988#(not (< main_~c~0 main_~k~0))} #57#return; {1988#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 07:58:30,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:30,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:30,042 INFO L272 TraceCheckUtils]: 32: Hoare triple {1988#(not (< main_~c~0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {1988#(not (< main_~c~0 main_~k~0))} assume !false; {1988#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 07:58:30,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {2010#(<= main_~k~0 (+ main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1988#(not (< main_~c~0 main_~k~0))} is VALID [2022-04-28 07:58:30,043 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1770#true} {2010#(<= main_~k~0 (+ main_~c~0 1))} #57#return; {2010#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 07:58:30,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:30,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:30,044 INFO L272 TraceCheckUtils]: 25: Hoare triple {2010#(<= main_~k~0 (+ main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {2010#(<= main_~k~0 (+ main_~c~0 1))} assume !false; {2010#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 07:58:30,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {2032#(<= main_~k~0 (+ main_~c~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {2010#(<= main_~k~0 (+ main_~c~0 1))} is VALID [2022-04-28 07:58:30,045 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1770#true} {2032#(<= main_~k~0 (+ main_~c~0 2))} #57#return; {2032#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 07:58:30,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:30,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:30,045 INFO L272 TraceCheckUtils]: 18: Hoare triple {2032#(<= main_~k~0 (+ main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {2032#(<= main_~k~0 (+ main_~c~0 2))} assume !false; {2032#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 07:58:30,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {2054#(<= main_~k~0 2)} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {2032#(<= main_~k~0 (+ main_~c~0 2))} is VALID [2022-04-28 07:58:30,046 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1770#true} {2054#(<= main_~k~0 2)} #55#return; {2054#(<= main_~k~0 2)} is VALID [2022-04-28 07:58:30,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID [2022-04-28 07:58:30,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID [2022-04-28 07:58:30,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {2054#(<= main_~k~0 2)} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1800#(not (= |assume_abort_if_not_#in~cond| 0))} {1770#true} #53#return; {2054#(<= main_~k~0 2)} is VALID [2022-04-28 07:58:30,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {1800#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1800#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:30,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1800#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:58:30,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#true} ~cond := #in~cond; {2082#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 07:58:30,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {1770#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1770#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {1770#true} call #t~ret5 := main(); {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1770#true} #63#return; {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {1770#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);call #Ultimate.allocInit(12, 3); {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1770#true} is VALID [2022-04-28 07:58:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-28 07:58:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:58:30,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526227764] [2022-04-28 07:58:30,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:58:30,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629608736] [2022-04-28 07:58:30,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629608736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:58:30,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:58:30,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-28 07:58:30,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:58:30,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519025267] [2022-04-28 07:58:30,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519025267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:58:30,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:58:30,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 07:58:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466663015] [2022-04-28 07:58:30,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:58:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:58:30,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:58:30,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:30,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:30,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 07:58:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:58:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 07:58:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-28 07:58:30,078 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:30,222 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-04-28 07:58:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 07:58:30,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 54 [2022-04-28 07:58:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:58:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:58:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 07:58:30,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 07:58:30,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:30,255 INFO L225 Difference]: With dead ends: 45 [2022-04-28 07:58:30,255 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 07:58:30,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:58:30,256 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:58:30,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:58:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 07:58:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 07:58:30,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:58:30,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:58:30,256 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:58:30,256 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:58:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:30,257 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:58:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:58:30,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:30,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:30,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 07:58:30,257 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 07:58:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:58:30,257 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 07:58:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:58:30,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:30,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:58:30,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:58:30,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:58:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 07:58:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 07:58:30,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-04-28 07:58:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:58:30,257 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 07:58:30,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-28 07:58:30,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 07:58:30,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:58:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 07:58:30,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:58:30,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 07:58:30,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 07:58:30,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:58:30,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 07:58:30,805 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 07:58:30,805 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 07:58:30,805 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 07:58:30,805 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6 8) the Hoare annotation is: true [2022-04-28 07:58:30,805 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 07:58:30,805 INFO L895 garLoopResultBuilder]: At program point L7-2(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 07:58:30,805 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 07:58:30,805 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 42) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 2)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (<= main_~c~0 2) .cse1 (<= 2 main_~c~0)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 1) .cse0 .cse1 (< 0 main_~k~0) (= main_~c~0 1)))) [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L29-1(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 2)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (<= main_~c~0 2) .cse1 (<= 2 main_~c~0)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 1) .cse0 .cse1 (< 0 main_~k~0) (= main_~c~0 1)))) [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 2)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~y~0 2) (< 1 main_~k~0) .cse0 (<= main_~c~0 2) .cse1 (<= 2 main_~c~0)) (and (<= 0 main_~k~0) .cse0 .cse1 (= main_~c~0 0) (= main_~y~0 0)) (and (= main_~y~0 1) .cse0 .cse1 (< 0 main_~k~0) (= main_~c~0 1)))) [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse0 (+ (- 1) main_~y~0)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= .cse0 0) (<= main_~k~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (< 1 main_~k~0) (= .cse0 1) (<= main_~k~0 2) (<= main_~c~0 2) .cse1))) [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 17 42) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 2)) [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 2)) [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 17 42) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (+ (- 1) main_~y~0)) (.cse1 (= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0))))) (or (and (= main_~x~0 0) (= main_~y~0 0)) (and (= .cse0 0) (<= main_~k~0 1) .cse1 (< 0 main_~k~0) (<= main_~c~0 1)) (and (< 1 main_~k~0) (= .cse0 1) (<= main_~k~0 2) (<= main_~c~0 2) .cse1))) [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 07:58:30,806 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 07:58:30,807 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 07:58:30,807 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-04-28 07:58:30,807 INFO L895 garLoopResultBuilder]: At program point L11(lines 11 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:58:30,807 INFO L895 garLoopResultBuilder]: At program point L10(lines 10 13) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:58:30,807 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:58:30,807 INFO L895 garLoopResultBuilder]: At program point L10-2(lines 9 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 07:58:30,807 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 07:58:30,809 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2, 2] [2022-04-28 07:58:30,810 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 07:58:30,812 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 07:58:30,815 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 07:58:30,840 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 07:58:30,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 07:58:30 BoogieIcfgContainer [2022-04-28 07:58:30,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 07:58:30,860 INFO L158 Benchmark]: Toolchain (without parser) took 7550.71ms. Allocated memory was 172.0MB in the beginning and 211.8MB in the end (delta: 39.8MB). Free memory was 122.9MB in the beginning and 104.1MB in the end (delta: 18.7MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. [2022-04-28 07:58:30,860 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:58:30,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.52ms. Allocated memory is still 172.0MB. Free memory was 122.6MB in the beginning and 147.9MB in the end (delta: -25.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-28 07:58:30,861 INFO L158 Benchmark]: Boogie Preprocessor took 21.12ms. Allocated memory is still 172.0MB. Free memory was 147.9MB in the beginning and 146.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:58:30,861 INFO L158 Benchmark]: RCFGBuilder took 250.76ms. Allocated memory is still 172.0MB. Free memory was 146.5MB in the beginning and 135.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 07:58:30,861 INFO L158 Benchmark]: TraceAbstraction took 7073.13ms. Allocated memory was 172.0MB in the beginning and 211.8MB in the end (delta: 39.8MB). Free memory was 135.0MB in the beginning and 104.1MB in the end (delta: 30.9MB). Peak memory consumption was 72.2MB. Max. memory is 8.0GB. [2022-04-28 07:58:30,862 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 172.0MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.52ms. Allocated memory is still 172.0MB. Free memory was 122.6MB in the beginning and 147.9MB in the end (delta: -25.3MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.12ms. Allocated memory is still 172.0MB. Free memory was 147.9MB in the beginning and 146.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.76ms. Allocated memory is still 172.0MB. Free memory was 146.5MB in the beginning and 135.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7073.13ms. Allocated memory was 172.0MB in the beginning and 211.8MB in the end (delta: 39.8MB). Free memory was 135.0MB in the beginning and 104.1MB in the end (delta: 30.9MB). Peak memory consumption was 72.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 159 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 275 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 121 PreInvPairs, 169 NumberOfFragments, 719 HoareAnnotationTreeSize, 121 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 58 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((y == 2 && 1 < k) && k <= 2) && c <= 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 2 <= c) || ((((0 <= k && k <= 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && c == 0) && y == 0)) || ((((y == 1 && k <= 2) && 2 * (y * y * y * y * y * y) + 6 * (y * y * y * y * y) + 5 * (y * y * y * y) == x * 12 + y * y) && 0 < k) && c == 1) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 07:58:30,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...